2P_4

(2, 4)-bishop graph | 8-graph 985

vertex count | 8 edge count | 6 connected component count | 2

acyclic | apex | asymmetric | bicolorable | bipartite | bishop | block | bridged | chordal | chordless | chromatically nonunique | class 1 | claw-free | determined by resistance | determined by spectrum | disconnected | dominating nonunique | flexible | forest | line graphs | linklessly embeddable | map | matchstick | Meyniel | multigraphic | noncayley | nonempty | noneulerian | nongeometric | nonhamiltonian | outerplanar | perfect | perfect matching | planar | projective planar | pseudoforest | Ptolemaic | simple | square-free | switchable | triangle-free | ungraceful | uniquely embeddable | unit-distance | untraceable | weakly perfect | well covered

(2, 4)-queen graph

two 3-paths

vertex degrees | 1 (4 vertices) | 2 (4 vertices)

radius | ∞ diameter | ∞ girth | ∞ vertex connectivity | 0 edge connectivity | 0

(x^2 - x - 1)^2 (x^2 + x - 1)^2

(x + 1)^6

x^6

chromatic number | 2 edge chromatic number | 2

(1/2 (-1 - sqrt(5)))^2 (1/2 (1 - sqrt(5)))^2 (1/2 (-1 + sqrt(5)))^2 (1/2 (1 + sqrt(5)))^2

(0 | 0 | 0 | 0 | 1 | 0 | 1 | 0 0 | 0 | 0 | 0 | 0 | 1 | 0 | 1 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 1 | 0 | 1 | 0 | 0 | 0 | 0 | 0 0 | 1 | 0 | 1 | 0 | 0 | 0 | 0)

(1 | 1 | 0 | 0 | 0 | 0 0 | 0 | 1 | 1 | 0 | 0 0 | 0 | 0 | 0 | 1 | 0 0 | 0 | 0 | 0 | 0 | 1 1 | 0 | 0 | 0 | 0 | 0 0 | 0 | 1 | 0 | 0 | 0 0 | 1 | 0 | 0 | 1 | 0 0 | 0 | 0 | 1 | 0 | 1)

Hosoya index | 25 Kirchhoff index | ∞ stability index | 25 Wiener index | ∞