Threshold graphs (Q2707734)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1584104
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Threshold graphs |
scientific article; zbMATH DE number 1584104 |
Statements
3 April 2001
0 references
graphic sequence
0 references
graphic partition
0 references
threshold graph
0 references
Laplacian matrix
0 references
0 references
0 references
0 references
0 references
Threshold graphs (English)
0 references
Let \(m\) be a given number of edges of a graph. A graphic partition of the number \(2m\) is a finite sequence of positive integers such that their sum is \(2m\) and they can be realized as degrees of vertices of a graph with \(m\) edges. A graph whose graphic partition is maximal (in a certain sense) is called a threshold graph. Such graphs are studied in the paper.NEWLINENEWLINEFor the entire collection see [Zbl 0933.00055].
0 references
