On the Laplacian coefficients and Laplacian-like energy of unicyclic graphs with \(n\) vertices and \(m\) pendant vertices
From MaRDI portal
Publication:1952839
DOI10.1155/2012/404067zbMath1264.05082OpenAlexW1975242032WikidataQ58906847 ScholiaQ58906847MaRDI QIDQ1952839
Publication date: 3 June 2013
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2012/404067
characteristic polynomialLaplacian matrixWiener indexstarlike treesunicyclic graphsLaplacian coefficientssmallest Laplacian-like energy
Related Items (1)
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 coefficients of unicyclic graphs
- Ordering trees by the Laplacian coefficients
- Operational research models in action, the result of international cooperation -- a potpourri
- 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 and Laplacian-like energy of unicyclic graphs with \(n\) vertices and \(m\) pendant vertices