+2 votes

The edge graph of a graph G is the graph with vertex set E(G) in which two vertices are joined if and only if they are adjacent edges in G.  

if G is a simple graph with degree sequence <1,2,2,3,3,3>, the no of edges in edge graph of G is?

asked Jul 12 in Discrete Maths by gbeditor (4,440 points)
reshown Jul 13 by gbeditor

Please log in or register to answer this question.