On the signless Laplacian spectra of k-trees

DOI10.1016/J.LAA.2014.11.010zbMATH Open1304.05098arXiv1507.02536OpenAlexW2053789525MaRDI QIDQ477752FDOQ477752

Shuchao Li, Min-jie Zhang

Publication date: 9 December 2014

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Abstract: In this paper, we use a new and correct method to determine the $n$-vertex $k$-trees with the first three largest signless Laplacian indices.

Full work available at URL: https://arxiv.org/abs/1507.02536

zbMATH Keywords

\(k\)-treesextremal graphsignless Laplacian indexsharp upper bound

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Extremal problems in graph theory (05C35)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Signless Laplacians of finite graphs
• Eigenvalues of the Laplacian of a graph^∗
• Which graphs are determined by their spectrum?
• A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
• Laplacian matrices of graphs: A survey
• Towards a spectral theory of graphs based on the signless Laplacian, I
• Towards a spectral theory of graphs based on the signless Laplacian. II.
• Bounds and conjectures for the signless Laplacian index of graphs
• Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
• A Spectral Erdős–Stone–Bollobás Theorem
• Sharp bounds for the signless Laplacian spectral radius in terms of clique number
• Counting unlabeled \(k\)-trees
• The number of labeled k-dimensional trees
• The signless Laplacian spread
• Eigenvectors of acyclic matrices
• On the signless Laplacian index of cacti with a given number of pendant vertices
• Ancestors and descendants in evolving k‐tree models
• Maxima of the Q-index: graphs with bounded clique number
• On the signless Laplacian index of unicyclic graphs with fixed diameter
• Spectra of digraphs
• Maximizing signless Laplacian or adjacency spectral radius of graphs subject to fixed connectivity
• Independence polynomials of \(k\)-tree related graphs
• Tree-width, clique-minors, and eigenvalues.
• On two conjectures of Randić index and the largest signless Laplacian eigenvalue of graphs
• Which \(k\)-trees are cover-incomparability graphs?
• A conjecture on the diameter and signless Laplacian index of graphs

Cited In (8)

• On maximum Estrada indices of \(k\)-trees
• The spectra and the signless Laplacian spectra of graphs with pockets
• Signless Laplacian determination for a family of double starlike trees
• Extremal Halin graphs with respect to the signless Laplacian spectra
• Corrigendum to: ``On the signless Laplacian spectra of \(k\)-trees
• On maximum signless Laplacian Estrada indices of \(k\)-trees
• The second least eigenvalue of the signless Laplacian of the complements of trees
• Trees with Four and Five Distinct Signless Laplacian Eigenvalues

This page was built for publication: On the signless Laplacian spectra of \(k\)-trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q477752)