The smallest Laplacian spectral radius of graphs with a given clique number

DOI10.1016/J.LAA.2012.04.016zbMath1244.05143OpenAlexW2019698842MaRDI QIDQ432731

Ji-Ming Guo, Wai Chee Shiu, Jian Xi Li

Publication date: 4 July 2012

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

Full work available at URL: https://doi.org/10.1016/j.laa.2012.04.016

zbMATH Keywords

clique numberLaplacian spectral radiusLaplacian characteristic polynomial

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

The smallest signless Laplacian spectral radius of graphs with a given clique number ⋮ Quotient of spectral radius, (signless) Laplacian spectral radius and clique number of graphs ⋮ The kite graph is determined by its adjacency spectrum

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the Laplacian spectral radii of bipartite graphs
• The effect on the Laplacian spectral radius of a graph by adding or grafting edges
• The Laplacian spectral radius of a graph under perturbation
• The Laplacian spectral radius of some graphs
• Laplacian graph eigenvectors
• Laplacian matrices of graphs: A survey
• An improved upper bound for Laplacian graph eigenvalues
• Expanding and forwarding
• The ordering of trees and connected graphs by algebraic connectivity
• On the second largest Laplacian eigenvalue of trees
• The Laplacian Spectrum of a Graph II

This page was built for publication: The smallest Laplacian spectral radius of graphs with a given clique number