Math Is Fun Forum

aloha

Member

Registered: 2010-12-02

Posts: 13

Graph Theory: spanning tree, degree of consistency, trees

Hi;
I've got a couple of examples, I came across, but I can not solve. Could you help me somehow? Thanks

(1) It can be any finite sequence of zeros and ones of a code tree root? Justify its decision.

(2) Can you draw a 2-connected graph on the fewest number of vertices and maximum degree of two vertices
two of them, adding only that there will be no 3-edge connected graph?

(3) Draw a 2-connected graph on the fewest number of vertices, so that it was adding a single edge
3-connected graph.

...Excuse my English

Last edited by aloha (2010-12-06 21:20:18)

aloha

Member

Registered: 2010-12-02

Posts: 13

Re: Graph Theory: spanning tree, degree of consistency, trees

(3)
Hi;
The third example I can think of that. What do you think? Thx

bobbym

bumpkin

From: Bumpkinland

Registered: 2009-04-12

Posts: 109,606

Re: Graph Theory: spanning tree, degree of consistency, trees

Hi aloha;

Are we talking about edge connectivity?

---

In mathematics, you don't understand things. You just get used to them.
If it ain't broke, fix it until it is.
Always satisfy the Prime Directive of getting the right answer above all else.