(1, 2)-stacked Book Graph
C_4
vertex count | 4 edge count | 4 connected component count | 1
antipodal | apex | arc-transitive | bicolorable | biconnected | bipartite | book | bridgeless | cactus | Cayley graphs | chordless | chromatically unique | circulant | class 1 | claw-free | cocktail party | complete bipartite | complete k-partite | conformally rigid | connected | cycle | cyclic | determined by resistance | determined by spectrum | distance-hereditary | distance-regular | distance-transitive | dominating unique | edge-transitive | Eulerian | flexible | geometric | Goethals-Seidel block design | graceful | grid | Haar | Hamilton-decomposable | Hamiltonian | Hamilton-laceable | Hamming | Harary | honeycomb toroidal | H-star connected | hypercube | integral | KC | Knödel | KP | ladder | LCF | line graphs | linklessly embeddable | local | map | matchstick | median | Meyniel | nonempty | Ore | outerplanar | perfect | perfect matching | planar | polyomino | projective planar | pseudoforest | pseudotree | quadratically embeddable | regular | rook | simple | stacked book | stacked prism | strongly perfect | strongly regular | switchable | symmetric | traceable | triangle-free | Turán | two-regular | unicyclic | unigraphic | uniquely colorable | uniquely embeddable | uniquely graceful | uniquely Hamiltonian | unit-distance | vertex-transitive | weakly perfect | well covered | white bishop | wreath | zero-two
2-ladder rung graph
square graph
vertex degrees | 2 (4 vertices)
radius | 2 diameter | 2 girth | 4 vertex connectivity | 2 edge connectivity | 2
(x - 2) x^2 (x + 2)
x^3 y + 4 x^3 + 6 x^2 + 4 x + 1
x^3 + x^2 + x + y
chromatic number | 2 edge chromatic number | 2
(-2)^1 0^2 2^1
(0 | 1 | 0 | 1 1 | 0 | 1 | 0 0 | 1 | 0 | 1 1 | 0 | 1 | 0)
(1 | 1 | 0 | 0 1 | 0 | 1 | 0 0 | 0 | 1 | 1 0 | 1 | 0 | 1)
Hosoya index | 7 Kirchhoff index | 5 stability index | 5 Wiener index | 8