K_(1, 1, 3)

(1, 1, 3)-complete 3-partite graph | 2-tree (5, 1) | (3, 2)-fan graph | 5-graph 19

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

almost Hamiltonian | apex | asymmetric | biconnected | bridgeless | chordal | chromatically nonunique | class 1 | complete k-partite | complete tripartite | connected | cyclic | determined by resistance | determined by spectrum | distance-hereditary | dominating unique | Eulerian | fan | graceful | integral | k-tree | Laman | linklessly embeddable | map | maximally nonhamiltonian | Meyniel | noncayley | nonempty | nongeometric | nonhamiltonian | no perfect matching | perfect | planar | projective planar | Ptolemaic | quadratically embeddable | rigid | simple | split | strongly perfect | traceable | unigraphic | uniquely colorable | uniquely embeddable | unswitchable | weakly perfect

triangle and two singletons

7-graph 1020

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

radius | 1 diameter | 2 girth | 3 vertex connectivity | 2 edge connectivity | 2

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

x^4 y^3 + 7 x^4 y^2 + 18 x^4 y + 20 x^4 + 3 x^3 y^2 + 15 x^3 y + 32 x^3 + 3 x^2 y + 21 x^2 + 7 x + 1

x^4 + 3 x^3 + 3 x^2 y + 3 x^2 + 3 x y^2 + 3 x y + x + y^3 + y^2 + y

chromatic number | 3 edge chromatic number | 4

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

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

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

Hosoya index | 14 Kirchhoff index | 7 stability index | 6 Wiener index | 13