Threshold graphs
From MaRDI portal
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].
Recommendations
Cited in
(26)- Threshold hypergraphs
- Hamiltonian threshold graphs
- Strict 2-threshold graphs
- Laplacian graph eigenvectors
- Maximal graphs and graphs with maximal spectral radius
- Mock threshold graphs
- Split graphs
- Threshold graphs and related topics
- Some results on multithreshold graphs
- On maximal graphical partitions that are the nearest to a given graphical partition
- scientific article; zbMATH DE number 4033780 (Why is no real title available?)
- scientific article; zbMATH DE number 4081591 (Why is no real title available?)
- scientific article; zbMATH DE number 1330692 (Why is no real title available?)
- scientific article; zbMATH DE number 568830 (Why is no real title available?)
- On Universal Threshold Graphs
- scientific article; zbMATH DE number 1161290 (Why is no real title available?)
- scientific article; zbMATH DE number 7378386 (Why is no real title available?)
- Multithreshold graphs
- On maximal graphical partitions
- scientific article; zbMATH DE number 2218519 (Why is no real title available?)
- Multithreshold multipartite graphs
- Distinguishing threshold of graphs
- Integral Laplacian graphs with a unique repeated Laplacian eigenvalue. I
- Multithreshold multipartite graphs with small parts
- Integral Laplacian graphs with a unique repeated Laplacian eigenvalue. II
- Unoriented Laplacian maximizing graphs are degree maximal
This page was built for publication: Threshold graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2707734)
