Minimizing the Laplacian-energy-like of graphs
From MaRDI portal
Publication:6618714
DOI10.1016/j.laa.2024.08.015MaRDI QIDQ6618714
Jing Tian, Gao-Xuan Luo, Shi-Cai Gong
Publication date: 15 October 2024
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graphs with the fewest matchings
- On the Laplacian coefficients of bicyclic graphs
- On the ordering of trees by the Laplacian coefficients
- Trees with minimal Laplacian coefficients
- On the Laplacian coefficients of unicyclic graphs
- Undirected simple connected graphs with minimum number of spanning trees
- Degree maximal graphs are Laplacian integral
- The characteristic polynomial of the Laplacian of graphs in (\(a\), \(b\))-linear classes
- Threshold graphs and related topics
- Laplacian spectra and spanning trees of threshold graphs
- Each \((n,m)\)-graph having the \(i\)-th minimal Laplacian coefficient is a threshold graph
- On the Laplacian coefficients of tricyclic graphs
- Threshold graphs of maximal Laplacian energy
- On the coefficients of the Laplacian characteristic polynomial of trees
- Extremal graphs for homomorphisms
This page was built for publication: Minimizing the Laplacian-energy-like of graphs
