Ordering \(Q\)-indices of graphs: given size and circumference
From MaRDI portal
Publication:6056721
DOI10.1016/j.disc.2023.113628zbMath1522.05277OpenAlexW4385562352MaRDI QIDQ6056721
Qiong Xiang Huang, Yarong Hu, Zhenzhen Lou
Publication date: 4 October 2023
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2023.113628
Combinatorics of partially ordered sets (06A07) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ordering non-bipartite unicyclic graphs with pendant vertices by the least \(Q\)-eigenvalue
- Ordering (signless) Laplacian spectral radii with maximum degrees of graphs
- A note on (signless) Laplacian spectral ordering with maximum degrees of graphs
- The Laplacian spectral radius of trees and maximum vertex degree
- Cycles in 2-connected graphs
- Arc coverings of graphs
- Signless Laplacians of finite graphs
- The spectral radius of graphs without paths and cycles of specified length
- On the Laplacian spectral radii of trees
- On the spectral radius of (0,1)-matrices
- On the maximal index of graphs with a prescribed number of edges
- Weakly pancyclic graphs
- The maximum number of cliques in graphs without long cycles
- Signless Laplacian spectral radius of graphs without short cycles or long cycles
- The signless Laplacian spectral radius of graphs with a prescribed number of edges
- Maxima of the \(Q\)-index: forbidden odd cycles
- Maxima of the \(Q\)-index: forbidden even cycles
- Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
- On maximal paths and circuits of graphs
- On three conjectures involving the signless Laplacian spectral radius of graphs
- On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
- Maximal circuits of graphs. I
- Extensions of the Erdős–Gallai theorem and Luo’s theorem
- The maximum number of $P_\ell$ copies in $P_k$-free graphs
- Variations on the Hamiltonian Theme
- Ordering trees by their largest eigenvalues
This page was built for publication: Ordering \(Q\)-indices of graphs: given size and circumference
