2P_2

(1, 4)-Knödel graph | 1-Hadamard graph | (2, 1)-bipartite Kneser graph | (2, 2)-bishop graph | (2, 2)-rook complement graph | 2-crown graph | 2-Haar graph | 4-circulant graph (2) | 4-cycle complement graph | 4-edge-transitive graph 6 | ...

vertex count | 4 edge count | 2 connected component count | 2

acyclic | apex | arc-transitive | bicolorable | bipartite | bipartite Kneser | bishop | bridged | Cayley graphs | chordal | chordless | chromatically nonunique | circulant | class 1 | claw-free | crown | cycle complement | determined by resistance | determined by spectrum | disconnected | distance-regular | distance-transitive | edge-transitive | forest | Haar | Hadamard | integral | Knödel | ladder rung | line graphs | matchstick | nonempty | noneulerian | nonhamiltonian | outerplanar | perfect | perfect matching | planar | projective planar | pseudoforest | regular | rook complement | simple | square-free | strongly perfect | strongly regular | symmetric | triangle-free | ungraceful | uniquely colorable | unit-distance | untraceable | vertex-transitive | weakly perfect | well covered

square graph

2-empty graph

vertex degrees | 1 (4 vertices)

radius | ∞ diameter | ∞ girth | ∞ vertex connectivity | 0 edge connectivity | 0

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

(x + 1)^2

x^2

chromatic number | 2 edge chromatic number | 1

(-1)^2 1^2

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

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

Hosoya index | 4 Kirchhoff index | ∞ stability index | 4 Wiener index | ∞