Number of Eulerian Graphs

Question

Find the number of connected Eulerian graphs with 6 unlabelled vertices.

Draw each of them.

Note: I'm looking for a fast procedure don't comment just the numerical answer.

Comments

then atmost is 14, how 15?

---

@shaikh see here we are talking about #edges to be connected and eulerian(graph) so minimum is 6 it cannot be 5 because u cannot reach back to starting node with 5 vertices as it will be a tree. (condition for eulerian graph)

atmost 15 because a complete graph will have 15 edges.

.

@mk utkarsh see the solution brother i have to really recall everything .

---

yes you are correct..

Answer 1

for a graph to be an Eulerian

​​​​​​​1) it must start and end at same vertex with each edge covered exactly  once and 

2) the degree of each node must be of even degree.

----------------------------------------------------------------------------------------------- 

for a graph with #vertex= 6

possible degree values(to satisfy if its euler or not even degree sequences)=

{2,2,2,2,2,2} , {4,2,2,2,2,2}, {4,4,2,2,2,2} , { 4,4,4,2,2,2} , { 4,4,4,4,2,2} , {4,4,4,4,4,4}  =  #sequences =7 out of which only 3rd sequence {4,4,2,2,2,2} will have 2 different graphs.

#total =8

----------------------------------------------------------------------------------------------

you can use Havel hakimi algorithm to check the validity of the degree sequence... i found each valid.

----------------------------------------------------------------------------------------------

i tried each possible sequence but every graph i went for was ISOMORPHIC to the down mentioned 8 graphs. 

----------------------------------------------------------------------------------------------

Comments

@srestha mam even degree disconnected graphs cannot be eulerian..

---

Note that a disconnected graph may also be Euler.

https://math.stackexchange.com/questions/1414667/is-it-possible-disconnected-graph-has-euler-circuit?rq=1

---

my mistake, updated !