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

Ji Ming Guo; Jianxi Li; Wai Chee Shiu

doi:10.1016/j.laa.2012.04.016

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

Ji Ming Guo, Jianxi Li, Wai Chee Shiu^*

^*Corresponding author for this work

Department of Mathematics

Research output: Contribution to journal › Journal article › peer-review

5 Citations (Scopus)

Abstract

The Laplacian spectral radius of a graph G is the largest eigenvalue of its Laplacian matrix. In this paper, the first three smallest values of the Laplacian spectral radii among all connected graphs with clique number ω are obtained.

Original language	English
Pages (from-to)	1109-1122
Number of pages	14
Journal	Linear Algebra and Its Applications
Volume	437
Issue number	4
DOIs	https://doi.org/10.1016/j.laa.2012.04.016
Publication status	Published - 15 Aug 2012

Scopus Subject Areas

Algebra and Number Theory
Numerical Analysis
Geometry and Topology
Discrete Mathematics and Combinatorics

User-Defined Keywords

Clique number
Laplacian characteristic polynomial
Laplacian spectral radius

Access to Document

10.1016/j.laa.2012.04.016

Cite this

@article{ec580ce7563543508f14ec476a38bd86,

title = "The smallest Laplacian spectral radius of graphs with a given clique number",

abstract = "The Laplacian spectral radius of a graph G is the largest eigenvalue of its Laplacian matrix. In this paper, the first three smallest values of the Laplacian spectral radii among all connected graphs with clique number ω are obtained.",

keywords = "Clique number, Laplacian characteristic polynomial, Laplacian spectral radius",

author = "Guo, {Ji Ming} and Jianxi Li and Shiu, {Wai Chee}",

note = "Funding Information: Partially supported by FRG, Hong Kong Baptist University, National Science Foundation (NSF) of China (Grant Nos. 10871204, 11101358), NSF of Fujian (Grant Nos. 2011J05014, 2011J01026), Project of Fujian Education Department (Grant No. JA11165), Fundamental Research Funds for the Central Universities (Grant No. 09CX04003A), Research Fund of Zhangzhou Normal University (Grant",

year = "2012",

month = aug,

day = "15",

doi = "10.1016/j.laa.2012.04.016",

language = "English",

volume = "437",

pages = "1109--1122",

journal = "Linear Algebra and Its Applications",

issn = "0024-3795",

publisher = "Elsevier Inc.",

number = "4",

}

TY - JOUR

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

AU - Guo, Ji Ming

AU - Li, Jianxi

AU - Shiu, Wai Chee

N1 - Funding Information: Partially supported by FRG, Hong Kong Baptist University, National Science Foundation (NSF) of China (Grant Nos. 10871204, 11101358), NSF of Fujian (Grant Nos. 2011J05014, 2011J01026), Project of Fujian Education Department (Grant No. JA11165), Fundamental Research Funds for the Central Universities (Grant No. 09CX04003A), Research Fund of Zhangzhou Normal University (Grant

PY - 2012/8/15

Y1 - 2012/8/15

N2 - The Laplacian spectral radius of a graph G is the largest eigenvalue of its Laplacian matrix. In this paper, the first three smallest values of the Laplacian spectral radii among all connected graphs with clique number ω are obtained.

AB - The Laplacian spectral radius of a graph G is the largest eigenvalue of its Laplacian matrix. In this paper, the first three smallest values of the Laplacian spectral radii among all connected graphs with clique number ω are obtained.

KW - Clique number

KW - Laplacian characteristic polynomial

KW - Laplacian spectral radius

UR - http://www.scopus.com/inward/record.url?scp=84861625419&partnerID=8YFLogxK

U2 - 10.1016/j.laa.2012.04.016

DO - 10.1016/j.laa.2012.04.016

M3 - Journal article

AN - SCOPUS:84861625419

SN - 0024-3795

VL - 437

SP - 1109

EP - 1122

JO - Linear Algebra and Its Applications

JF - Linear Algebra and Its Applications

IS - 4

ER -

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

Abstract

Scopus Subject Areas

User-Defined Keywords

Access to Document

Other files and links

Fingerprint

Cite this