14-vertex Transitive Graph 2
7P_2
vertex count | 14 edge count | 7 connected component count | 7
acyclic | apex | arc-transitive | bicolorable | bipartite | block | bridged | Cayley graphs | chordal | chordless | circulant | class 1 | claw-free | disconnected | distance-regular | distance-transitive | dominating nonunique | edge-transitive | flexible | forest | Haar | integral | Knödel | ladder rung | line graphs | linklessly embeddable | local | map | matchstick | Meyniel | nonempty | noneulerian | nongeometric | nonhamiltonian | outerplanar | perfect | perfect matching | planar | projective planar | pseudoforest | Ptolemaic | regular | simple | square-free | strongly perfect | strongly regular | switchable | symmetric | triangle-free | ungraceful | unigraphic | uniquely embeddable | unit-distance | untraceable | vertex-transitive | weakly perfect | well covered
7-cocktail party graph
7-empty graph
vertex degrees | 1 (14 vertices)
radius | ∞ diameter | ∞ girth | ∞ vertex connectivity | 0 edge connectivity | 0
(x - 1)^7 (x + 1)^7
(x + 1)^7
x^7
chromatic number | 2 edge chromatic number | 1
(-1)^7 1^7
Hosoya index | 128 Kirchhoff index | ∞ stability index | 128 Wiener index | ∞