Sequences of degrees of edges of self-complementary graphs
From MaRDI portal
The degree of an edge of a graph is the unordered pair of degrees of its end vertices. A graph G is a realization of a sequence of unordered pairs of natural numbers if this sequence consists of the degrees of the edges of G. This paper characterizes those sequences that have self- complementary realizations.
Recommendations
Cites work
Cited in
(5)
This page was built for publication: Sequences of degrees of edges of self-complementary graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q795068)