Each \((n,m)\)-graph having the \(i\)-th minimal Laplacian coefficient is a threshold graph
From MaRDI portal
Publication:2238881
DOI10.1016/j.laa.2021.09.013zbMath1476.05114OpenAlexW3200334570MaRDI QIDQ2238881
Shi-Cai Gong, Peng Zou, Xiao Dong Zhang
Publication date: 2 November 2021
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2021.09.013
Trees (05C05) Graph polynomials (05C31) Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Cites Work
- Unnamed Item
- On the Laplacian coefficients of unicyclic graphs with prescribed matching number
- Ordering of trees with fixed matching number by the Laplacian coefficients
- On the Laplacian coefficients of bicyclic graphs
- Laplacian coefficients of trees with given number of leaves or vertices of degree two
- On the ordering of trees by the Laplacian coefficients
- On the Laplacian coefficients of acyclic graphs
- Trees with minimal Laplacian coefficients
- On the Laplacian coefficients of unicyclic graphs
- Undirected simple connected graphs with minimum number of spanning trees
- Ordering trees by the Laplacian coefficients
- A certain polynomial of a graph and graphs with an extremal number of trees
- No threshold graphs are cospectral
- Threshold graphs and related topics
- Laplacian spectra and spanning trees of threshold graphs
- On the Laplacian coefficients of tricyclic graphs
- Laplacian coefficients of trees with a given bipartition
- On family of graphs with minimum number of spanning trees
- Laplacian coefficients of unicyclic graphs with the number of leaves and girth
- On the coefficients of the Laplacian characteristic polynomial of trees
- A connection between ordinary and Laplacian spectra of bipartite graphs
- Network transformations and bounding network reliability
- Wiener index of trees: Theory and applications
This page was built for publication: Each \((n,m)\)-graph having the \(i\)-th minimal Laplacian coefficient is a threshold graph
