C_5

(1, 5)-KC graph | (2, 5)-Harary graph | 2-Andrásfai graph | 3-Mycielski graph | (5, 1)-stacked prism graph | (5, 1)-uniquely hamiltonian graph | (5, 1)-wreath graph | 5-arc transitive graph 1 | 5-circulant graph (1) | 5-circulant graph (2) | ...

vertex count | 5 edge count | 5 connected component count | 1

Andrásfai | apex | arc-transitive | biconnected | bridgeless | cactus | Cayley graphs | chordless | chromatically unique | circulant | class 2 | claw-free | conference | conformally rigid | connected | cycle | cycle complement | cyclic | determined by resistance | determined by spectrum | distance-regular | distance-transitive | dominating unique | edge-transitive | Eulerian | flexible | geodetic | Hamilton-decomposable | Hamiltonian | Harary | imperfect | KC | LCF | line graphs | linklessly embeddable | local | map | matchstick | Mycielski | nonempty | nongeometric | no perfect matching | outerplanar | Paley | planar | projective planar | pseudoforest | pseudotree | quadratically embeddable | regular | self-complementary | simple | square-free | stacked prism | strongly regular | switchable | symmetric | traceable | triangle-free | two-regular | ungraceful | unicyclic | unigraphic | uniquely embeddable | uniquely Hamiltonian | unit-distance | vertex-transitive | well covered | wreath

5-cycle graph

5-cycle graph

vertex degrees | 2 (5 vertices)

radius | 2 diameter | 2 girth | 5 vertex connectivity | 2 edge connectivity | 2

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

x^4 y + 5 x^4 + 10 x^3 + 10 x^2 + 5 x + 1

x^4 + x^3 + x^2 + x + y

chromatic number | 3 edge chromatic number | 3

(1/2 (-1 - sqrt(5)))^2 (1/2 (-1 + sqrt(5)))^2 2^1

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

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

Hosoya index | 11 Kirchhoff index | 10 stability index | 2 Wiener index | 15