Prove there is precisely one 4 regular graph on 6 vertices.

any advice will help

Printable View

- December 9th 2009, 01:42 AMAwesomeDesiKid4-regular Graph
Prove there is precisely one 4 regular graph on 6 vertices.

any advice will help - December 9th 2009, 02:00 AMguildmage
I don't know if this will work but have you tried showing that any two 4-regular graph on 6 vertices are isomorphic?

- December 9th 2009, 03:30 AMAwesomeDesiKid
- December 19th 2009, 05:47 PMkumarstays4 regular graph on 6 vertices.
That will be a graph obtained by removing 3 edges from complete graph on 5 vertices .

proof .

consider 5-regular graph with 6 vertices it is nothing but complete graph on 5 vertices .Now you need to reduce one degree for each of six vertices that is you need to remove 3 edges. - December 19th 2009, 05:49 PMkumarstays4-regular graph with 6 vertices
That will be a graph obtained by removing 3 edges from complete graph on 5 vertices .

proof .

consider 5-regular graph with 6 vertices it is nothing but complete graph on 5 vertices .Now you need to reduce one degree for each of six vertices that is you need to remove 3 edges.