K^__4
vertex count | 4 edge count | 0 connected component count | 4
acyclic | antelope | apex | bicolorable | bipartite | bishop | black bishop | bridgeless | camel | Cayley graphs | chordal | chordless | chromatically unique | circulant | class 1 | claw-free | determined by resistance | determined by spectrum | disconnected | distance-regular | distance-transitive | edge-transitive | empty | Eulerian | fiveleaper | forest | giraffe | integral | Keller | Kneser | knight | line graphs | matchstick | nonhamiltonian | no perfect matching | outerplanar | perfect | planar | projective planar | pseudoforest | regular | rook complement | simple | split | square-free | strongly perfect | strongly regular | symmetric | triangle-free | Turán | ungraceful | uniquely colorable | unit-distance | untraceable | vertex-transitive | weakly perfect | well covered | wheel complement | white bishop | zebra
tetrahedral graph
null graph
vertex degrees | 0 (4 vertices)
radius | ∞ diameter | ∞ girth | ∞ vertex connectivity | 0 edge connectivity | 0
x^4
1
1
chromatic number | 1 edge chromatic number | 0
0^4
(0 | 0 | 0 | 0 0 | 0 | 0 | 0 0 | 0 | 0 | 0 0 | 0 | 0 | 0)
Hosoya index | 1 Kirchhoff index | ∞ stability index | 1 Wiener index | ∞