How many cycles exist in a K5 graph with one edge missing?
are all K5 graphs with one edge missing isomorphic?

Definitions
a Kn graph is a graph with n vertices and all vertices are connected to each other (total number of edges possible with n vertices, nchoose2)
a cycle has to start and end with the same vertex, and can only intersect all other vertices only once

Question

How many cycles exist in a K5 graph with one edge missing?
are all K5 graphs with one edge missing isomorphic?

Definitions
a Kn graph is a graph with n vertices and all vertices are connected to each other (total number of edges possible with n vertices, nchoose2)
a cycle has to start and end with the same vertex, and can only intersect all other vertices only once

dan815 · Answer

i was thinking of solving this more combinatorically

dan815 · Answer

but id have to first know if all k5 graphs with 1 edge missing is infact isomorphic,

dan815 · Answer

|dw:1442452514625:dw|