From Mathematical Circles (Russian Experience)
Geometry
Level
pending
- Which of the following is true that two graphs must be isomorphic;
- 1) they both have 10 vertices and the degree of each equals 9?
- 2) they both have 8 vertices and the degree of each equals 3?
- 3) they are both connected, without cycles, and have 6 edges?
3
2
None of these
1
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
1 solution
If each vertex is joined to every other one all are same and hence only one graph exists.