C_4

(1, 2, 2)-grid graph | (1, 2)-stacked book graph | (1, 4, 1)-honeycomb toroidal graph | (1, 4, 3)-honeycomb toroidal graph | 1-book graph | 1-polyomino graph 1 | (2, 1)-bipartite (0, 2)-graph | (2, 1)-Goethals-Seidel block design graph | (2, 2)-bar graph | (2, 2)-complete 2-partite graph | ...

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 | connected | cycle | cyclic | determined by resistance | determined by spectrum | distance-regular | distance-transitive | edge-transitive | Eulerian | Goethals-Seidel block design | graceful | grid | Haar | Hamilton-decomposable | Hamiltonian | Hamilton-laceable | Hamming | Harary | honeycomb toroidal | H-star connected | hypercube | integral | Knödel | ladder | LCF | line graphs | local | matchstick | median | nonempty | Ore | outerplanar | perfect | perfect matching | planar | polyomino | projective planar | pseudoforest | pseudotree | regular | rook | simple | stacked book | stacked prism | strongly perfect | strongly regular | symmetric | traceable | triangle-free | Turán | two-regular | unicyclic | uniquely colorable | 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