Bounds and conjectures for the signless Laplacian index of graphs
From MaRDI portal
Publication:968999
DOI10.1016/j.laa.2010.01.027zbMath1214.05079OpenAlexW2044994579WikidataQ123198668 ScholiaQ123198668MaRDI QIDQ968999
Publication date: 11 May 2010
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2010.01.027
Related Items
Further results on the spectral radius of matrices and graphs, On the spectral radius of the adjacency matrix and signless Laplacian matrix of a graph, Extremal Halin graphs with respect to the signless Laplacian spectra, The signless Laplacian spectral radius of \(k\)-connected irregular graphs, A sharp lower bound on the signless Laplacian index of graphs with \((\kappa,\tau)\)-regular sets, Some upper bounds for the signless Laplacian spectral radius of digraphs, Sharp bounds for the signless Laplacian spectral radius in terms of clique number, Maxima of the \(Q\)-index: graphs with no \(K_{1,t}\)-minor, Bounds on the independence number and signless Laplacian index of graphs, The spectral radius of signless Laplacian matrix and sum-connectivity index of graphs, On the signless Laplacian index of cacti with a given number of pendant vertices, The least eigenvalue of the signless Laplacian of the complements of trees, On a conjecture for the signless Laplacian spectral radius of cacti with given matching number, The Randić index and signless Laplacian spectral radius of graphs, Sharp bounds for the spectral radius of nonnegative matrices, A conjecture on the diameter and signless Laplacian index of graphs, On the signless Laplacian spectra of \(k\)-trees, Bounds on the spectral radius of general hypergraphs in terms of clique number, On ordinary and signless Laplacian spectral radius of graphs with fixed number of branch vertices, Distance Laplacian eigenvalues and chromatic number in graphs, On the signless Laplacian index and radius of graphs, Spectral radius and signless Laplacian spectral radius of strongly connected digraphs, The signless Laplacian spectral radius of tricyclic graphs and trees with \(k\) pendant vertices, On two conjectures of Randić index and the largest signless Laplacian eigenvalue of graphs, Asymptotic incidence energy of lattices, On the average eccentricity, the harmonic index and the largest signless Laplacian eigenvalue of a graph, Computing the maximal signless Laplacian index among graphs of prescribed order and diameter, Domination and Spectral Graph Theory, TWO SHARP UPPER BOUNDS FOR THE SIGNLESS LAPLACIAN SPECTRAL RADIUS OF GRAPHS, Quotient of spectral radius, (signless) Laplacian spectral radius and clique number of graphs, Laplacian and signless Laplacian spectral radii of graphs with fixed domination number
Uses Software
Cites Work
- Signless Laplacians of finite graphs
- A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
- Towards a spectral theory of graphs based on the signless Laplacian. II.
- Bounds on the index of the signless Laplacian of a graph
- On the maximal signless Laplacian spectral radius of graphs with given matching number
- Man-machine theorem proving in graph theory
- INGRID: A graph invariant manipulator
- Which graphs are determined by their spectrum?
- Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
- Properties of spectra of graphs and line graphs
- Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
- Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
- Eigenvalue bounds for the signless laplacian
- Towards a spectral theory of graphs based on the signless Laplacian, I
- On three conjectures involving the signless Laplacian spectral radius of graphs
- Towards a spectral theory of graphs based on the signless Laplacian, III
- The Signless Laplacian Spectral Radius of Unicyclic Graphs with Graph Constraints
- An inequality for the chromatic number of a graph
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item