P_2×P_3

(1, 2, 3)-grid graph | (1, 3)-stacked book graph | (2, 2)-stacked book graph | (2, 3)-grid graph | (2, 3)-KP graph | 2-book graph | 2-polyomino graph 1 | (3, 2)-bar graph | 3-ladder graph | (6, 4)-uniquely hamiltonian graph | ...

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

apex | asymmetric | bicolorable | biconnected | bipartite | book | bridgeless | chromatically unique | class 1 | connected | cyclic | determined by resistance | determined by spectrum | dominating nonunique | flexible | graceful | grid | Hamiltonian | KP | ladder | linklessly embeddable | map | matchstick | median | Meyniel | multigraphic | noncayley | nonempty | noneulerian | nongeometric | outerplanar | perfect | perfect matching | planar | polyomino | projective planar | quadratically embeddable | simple | stacked book | switchable | traceable | triangle-free | uniquely colorable | uniquely embeddable | uniquely Hamiltonian | unit-distance | weakly perfect

trans-square with two triangles

(3, 5)-white bishop graph

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

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

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

x^5 y^2 + 7 x^5 y + 15 x^5 + 6 x^4 y + 33 x^4 + 2 x^3 y + 35 x^3 + 21 x^2 + 7 x + 1

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