Degree maximal graphs are Laplacian integral (Q1322880)
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 maximal graphs are Laplacian integral |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Degree maximal graphs are Laplacian integral |
scientific article |
Statements
Degree maximal graphs are Laplacian integral (English)
0 references
11 September 1994
0 references
A graph is maximal if its degree sequence is majorized by no other graphic sequence. The author presents an algorithmic construction of all maximal graphs. It follows that the Laplacian spectrum of a maximal graph is the conjugate of its degree sequence.
0 references
degree sequence
0 references
graphic sequence
0 references
maximal graphs
0 references
Laplacian spectrum
0 references
