1 Answers
In the mathematical field of graph theory, the butterfly graph is a planar, undirected graph with 5 vertices and 6 edges. It can be constructed by joining 2 copies of the cycle graph C3 with a common vertex and is therefore isomorphic to the friendship graph F2.
The butterfly graph has diameter 2 and girth 3, radius 1, chromatic number 3, chromatic index 4 and is both Eulerian and a penny graph. It is also a 1-vertex-connected graph and a 2-edge-connected graph.
There are only 3 non-graceful simple graphs with five vertices. One of them is the butterfly graph. The two others are cycle graph C5 and the complete graph K5.
4 views
Answered