K^__2

(1, 2)-bishop graph | (1, 2)-camel graph | (1, 2)-fiveleaper graph | (1, 2)-giraffe graph | (1, 2)-knight graph | (1, 2)-rook complement graph | (1, 2)-zebra graph | (1, 3)-black bishop graph | (1, 4)-black bishop graph | (1, 4)-white bishop graph | ...

vertex count | 2 edge count | 0 connected component count | 2

acyclic | almost controllable | apex | bicolorable | bipartite | bishop | black bishop | block | bridgeless | camel | Cayley graphs | chordal | chordless | chromatically unique | circulant | class 1 | claw-free | cocktail party | crown | determined by resistance | determined by spectrum | disconnected | distance-regular | distance-transitive | dominating unique | edge-transitive | empty | Eulerian | fiveleaper | flexible | forest | giraffe | integral | knight | line graphs | linklessly embeddable | map | matchstick | Meyniel | nongeometric | nonhamiltonian | no perfect matching | outerplanar | path complement | perfect | planar | projective planar | pseudoforest | Ptolemaic | regular | rook complement | simple | split | square-free | strongly perfect | strongly regular | symmetric | triangle-free | Turán | ungraceful | unigraphic | uniquely colorable | uniquely embeddable | unit-distance | unswitchable | untraceable | vertex-transitive | weakly perfect | well covered | white bishop | zebra

2-path graph

null graph

vertex degrees | 0 (2 vertices)

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

x^2

1

1

chromatic number | 1 edge chromatic number | 0

0^2

(0 | 0 0 | 0)

Hosoya index | 1 Kirchhoff index | ∞ stability index | 1 Wiener index | ∞