On the signless Laplacian index of cacti with a given number of pendant vertices
From MaRDI portal
(Redirected from Publication:417533)
Recommendations
- On a conjecture for the signless Laplacian spectral radius of cacti with given matching number
- On the maximum (signless) Laplacian spectral radius of the cacti
- Ordering cacti with \(n\) vertices and \(k\) cycles by their Laplacian spectral radii
- On the signless Laplacian Estrada index of cacti
- On the index of cactuses with n vertices
Cites work
- scientific article; zbMATH DE number 3972892 (Why is no real title available?)
- scientific article; zbMATH DE number 740754 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
- Bounds and conjectures for the signless Laplacian index of graphs
- Bounds on the \(Q\)-spread of a graph
- Bounds on the index of the signless Laplacian of a graph
- Eigenvalues of the Laplacian of a graph∗
- Eigenvectors of acyclic matrices
- First eigenvalue and first eigenvectors of a nonsingular unicyclic mixed graph
- Graph theory
- Laplacian matrices of graphs: A survey
- Maximizing spectral radius of unoriented Laplacian matrix over bicyclic graphs of a given order
- Minimizing the Laplacian spectral radius of trees with given matching number
- On graphs whose signless Laplacian index does not exceed 4.5
- On the maximal signless Laplacian spectral radius of graphs with given matching number
- On the signless Laplacian spectral radius of graphs with cut vertices
- On three conjectures involving the signless Laplacian spectral radius of graphs
- Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
- Signless Laplacians of finite graphs
- The maximum clique and the signless Laplacian eigenvalues
- The signless Laplacian spectral radius of graphs with given chromatic number
- The signless Laplacian spectral radius of graphs with given degree sequences
- The signless Laplacian spectral radius of graphs with given number of pendant vertices
- Towards a spectral theory of graphs based on the signless Laplacian. I
- Towards a spectral theory of graphs based on the signless Laplacian. II.
- Unoriented Laplacian maximizing graphs are degree maximal
- Which graphs are determined by their spectrum?
Cited in
(18)- On the eigenvalues of firefly graphs
- Extremal cacti of given matching number with respect to the distance spectral radius
- On the least eigenvalue of cacti with pendant vertices
- The spanning k-trees, perfect matchings and spectral radius of graphs
- \(A_\alpha\)-spectrum of a firefly graph
- Extremal results for cacti
- scientific article; zbMATH DE number 6402289 (Why is no real title available?)
- On a conjecture for the signless Laplacian spectral radius of cacti with given matching number
- On the index of cactuses with n vertices
- On a conjecture for the signless Laplacian eigenvalues
- The second least eigenvalue of the signless Laplacian of the complements of trees
- Extremal Halin graphs with respect to the signless Laplacian spectra
- Some graphs determined by their (signless) Laplacian spectra.
- \(A_\alpha\) and \(L_\alpha\)-spectral properties of spider graphs
- Sharp upper bounds of $A_\alpha$-spectral radius of cacti with given pendant vertices
- The eccentricity spread of weak-friendship graphs
- Ordering cacti with signless Laplacian spread
- On the signless Laplacian spectra of \(k\)-trees
This page was built for publication: On the signless Laplacian index of cacti with a given number of pendant vertices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q417533)