1-tree (7, 8) | 6-matchstick graph 23 | 7-graph 351 | 7-tree 8 | pathwidth 1 forbidden minor 2

vertex count | 7 edge count | 6 connected component count | 1

acyclic | apex | asymmetric | bicolorable | bipartite | block | bridged | cactus | chordal | chordless | chromatically nonunique | class 1 | connected | determined by resistance | distance-hereditary | dominating nonunique | flexible | forest | geodetic | graceful | integral | k-tree | linklessly embeddable | lobster | map | matchstick | median | Meyniel | multigraphic | noncayley | nonempty | noneulerian | nongeometric | nonhamiltonian | no perfect matching | not determined by spectrum | outerplanar | pathwidth 1 forbidden minor | perfect | planar | projective planar | pseudoforest | pseudotree | Ptolemaic | quadratically embeddable | simple | spider | spoke | square-free | switchable | tree | triangle-free | tripod | uniquely colorable | uniquely embeddable | unit-distance | untraceable | weakly perfect

heptahedral graph 34

net graph

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

radius | 2 diameter | 4 girth | ∞ vertex connectivity | 1 edge connectivity | 1

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

(x + 1)^6

x^6

chromatic number | 2 edge chromatic number | 3

(-2)^1 (-1)^2 0^1 1^2 2^1

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

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

Hosoya index | 20 Kirchhoff index | 48 stability index | 0 Wiener index | 48