Degree sets of degree uniform graphs (Q1068111): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02582953 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2006781049 / rank | |||
Normal rank | |||
Latest revision as of 10:44, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Degree sets of degree uniform graphs |
scientific article |
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
