Degree sets of degree uniform graphs (Q1068111)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Degree sets of degree uniform graphs |
scientific article; zbMATH DE number 3929062
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Degree sets of degree uniform graphs |
scientific article; zbMATH DE number 3929062 |
Statements
Degree sets of degree uniform graphs (English)
0 references
1985
0 references
A graph G is n-degree uniform if for every nonnegative integer r, there are either no vertices of degree r or n vertices of degree r. For any integer \(n\geq 2\), a necessary and sufficient condition for a (finite, nonempty) set of positive integers to be the degree set of an n-degree uniform graph is given.
0 references
degree set
0 references
degree uniform graph
0 references
