(1, 4)-Hamming Graph
K_4
vertex count | 4 edge count | 6 connected component count | 1
apex | arc-transitive | arrangement | biconnected | block | bridgeless | cage | Cayley graphs | chordal | chromatically unique | circulant | class 1 | claw-free | complete | complete k-partite | completely regular | cone | conformally rigid | connected | cubic | cyclic | determined by resistance | determined by spectrum | distance-hereditary | distance-regular | distance-transitive | dominating unique | Doob | edge-transitive | folded cube | fully reconstructible in C^1 | geodetic | geometric | graceful | Halin | halved cube | Hamilton-connected | Hamilton-decomposable | Hamiltonian | Hamming | Harary | H-star connected | integral | Jahangir | Johnson | king | Kneser | KP | k-tree | LCF | line graphs | linklessly embeddable | local | map | Meyniel | Moore | nonempty | noneulerian | Ore | pancyclic | pathwidth 2 forbidden minor | perfect | perfect matching | planar | Platonic | polyhedral | projective planar | Ptolemaic | quadratically embeddable | queen | regular | rigid | rook | self-dual | Sierpiński tetrahedron | simple | split | strongly perfect | strongly regular | symmetric | traceable | triangulated | Turán | uniform skeleton | unigraphic | uniquely colorable | uniquely embeddable | uniquely graceful | unit-distance forbidden | unswitchable | vertex-transitive | weakly perfect | well covered | wheel | zero-two
4-empty graph
tetrahedral graph
octahedral graph
vertex degrees | 3 (4 vertices)
radius | 1 diameter | 1 girth | 3 vertex connectivity | 3 edge connectivity | 3
(x - 3) (x + 1)^3
x^3 y^3 + 6 x^3 y^2 + 15 x^3 y + 16 x^3 + 4 x^2 y + 15 x^2 + 6 x + 1
x^3 + 3 x^2 + 4 x y + 2 x + y^3 + 3 y^2 + 2 y
chromatic number | 4 edge chromatic number | 3
(-1)^3 3^1
(0 | 1 | 1 | 1 1 | 0 | 1 | 1 1 | 1 | 0 | 1 1 | 1 | 1 | 0)
(1 | 1 | 1 | 0 | 0 | 0 1 | 0 | 0 | 1 | 1 | 0 0 | 1 | 0 | 1 | 0 | 1 0 | 0 | 1 | 0 | 1 | 1)
Hosoya index | 10 Kirchhoff index | 3 stability index | 10 Wiener index | 6