10P_2

(1, 20)-Knödel graph | 20-circulant graph (10) | 20-vertex transitive graph 2 | (2, 10)-fiveleaper graph | 512-Haar graph | (6, 3)-Kneser graph

vertex count | 20 edge count | 10 connected component count | 10

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

10-cocktail party graph

10-empty graph

vertex degrees | 1 (20 vertices)

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

(x - 1)^10 (x + 1)^10

(x + 1)^10

x^10

chromatic number | 2 edge chromatic number | 1

(-1)^10 1^10

Hosoya index | 1024 Kirchhoff index | ∞ stability index | 1024 Wiener index | ∞