Can a graph be an edge graph if it contains an isomorphic sub-graph?

[Cuttlas]

Hi

Are these two graphs EQUAL to each other?

Exactly If a Graph contains the left graph in image as a sub-graph then it can not be an edge graph. the question is about the right one, Is it equal with left one? if yes, then does it mean If a Graph contains the right graph in image as a sub-graph too then it can not be an edge graph because it is the same as left one?

Please help me solve this small problem :)

 

[micromass]

You have not given sufficient information to determine equality. Indeed, you must label the vertices and the edges, and only then can we decide equality.

But to be honest, equality of graphs is not a very useful concept. What is certainly true is that the graphs in question are isomorphic. And because of this, the answer to your following question is yes:

does it mean If a Graph contains the right graph in image as a sub-graph too then it can not be an edge graph because it is the same as left one?