2-tree (6, 4)
T_2
vertex count | 6 edge count | 9 connected component count | 1
apex | asymmetric | biconnected | bridgeless | chordal | chromatically nonunique | class 1 | claw-free | connected | cyclic | determined by resistance | determined by spectrum | dominating nonunique | Dorogovtsev-Goltsev-Mendes | erected polygon | Eulerian | Hamiltonian | k-tree | Laman | line graphs | linklessly embeddable | map | matchstick | Meyniel | noncayley | nonempty | nongeometric | not uniquely embeddable | outerplanar | pancyclic | pathwidth 2 forbidden minor | perfect | perfect matching | planar | polyiamond | projective planar | quadratically embeddable | rigid | Sierpiński gasket | simple | split | stellation diagram | sun | switchable | traceable | triangular grid | triangular honeycomb king | ungraceful | unigraphic | uniquely colorable | uniquely Hamiltonian | unit-distance | weakly perfect
net graph
(not a named graph)
vertex degrees | 2 (3 vertices) | 4 (3 vertices)
radius | 2 diameter | 2 girth | 3 vertex connectivity | 2 edge connectivity | 2
(x^2 - 2 x - 4) (x^2 + x - 1)^2
x^5 y^4 + 9 x^5 y^3 + 33 x^5 y^2 + 63 x^5 y + 54 x^5 + 3 x^4 y^3 + 21 x^4 y^2 + 69 x^4 y + 99 x^4 + 3 x^3 y^2 + 27 x^3 y + 80 x^3 + 4 x^2 y + 36 x^2 + 9 x + 1
x^5 + 4 x^4 + 4 x^3 y + 6 x^3 + 3 x^2 y^2 + 9 x^2 y + 4 x^2 + 3 x y^3 + 6 x y^2 + 6 x y + x + y^4 + 2 y^3 + 3 y^2 + y
chromatic number | 3 edge chromatic number | 4
(1/2 (-1 - sqrt(5)))^2 (1 - sqrt(5))^1 (1/2 (-1 + sqrt(5)))^2 (1 + sqrt(5))^1
(0 | 0 | 0 | 1 | 1 | 0 0 | 0 | 0 | 1 | 0 | 1 0 | 0 | 0 | 0 | 1 | 1 1 | 1 | 0 | 0 | 1 | 1 1 | 0 | 1 | 1 | 0 | 1 0 | 1 | 1 | 1 | 1 | 0)
(1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 0 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 0 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 1 | 0 | 1 | 0 | 0 | 0 | 1 | 1 | 0 0 | 1 | 0 | 0 | 1 | 0 | 1 | 0 | 1 0 | 0 | 0 | 1 | 0 | 1 | 0 | 1 | 1)
Hosoya index | 27 Kirchhoff index | 10.83 stability index | 23 Wiener index | 21