Degree sequence

Материал из WikiGrapp
Перейти к:навигация, поиск

Degree sequence — степенная последовательность.

For a graph G, its degree sequence d_{1} \geq d_{2} \geq \ldots \geq d_{n} is the ordered sequence of the degrees of its vertices. A sequence d_{1} \geq d_{2} \geq \ldots \geq d_{n} with n-1 \geq d_{1} is a graphic sequence of numbers if there is a graph having D_{1},
\ldots, d_{n} as its degree sequence.

See also

  • Havel — Hakimi criterion, Erd\ddot{o}s — Gallai criterion.