On the Laplacian coefficients of tricyclic graphs
From MaRDI portal
Publication:2257205
DOI10.1016/j.jmaa.2013.03.059zbMath1306.05145OpenAlexW1975580596MaRDI QIDQ2257205
Xinying Pai, Ji-Ming Guo, San-Yang Liu
Publication date: 24 February 2015
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmaa.2013.03.059
Related Items (3)
On the Laplacian coefficients of tricyclic graphs with prescribed matching number ⋮ On the lower and upper bounds for different indices of tricyclic graphs ⋮ Each \((n,m)\)-graph having the \(i\)-th minimal Laplacian coefficient is a threshold graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the Laplacian coefficients of unicyclic graphs with prescribed matching number
- 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
- On the Laplacian spectral radii of bicyclic graphs
- On the Laplacian coefficients of unicyclic graphs
- Ordering trees by the Laplacian coefficients
- A certain polynomial of a graph and graphs with an extremal number of trees
- Laplacian coefficients of trees with a given bipartition
- A connection between ordinary and Laplacian spectra of bipartite graphs
This page was built for publication: On the Laplacian coefficients of tricyclic graphs
