The Laplacian spectral radius of some graphs

Jianxi Li; Wai Chee Shiu; Wai Hong Chan

doi:10.1016/j.laa.2009.02.013

The Laplacian spectral radius of some graphs

Jianxi Li
, Wai Chee Shiu^*
, Wai Hong Chan

^*Corresponding author for this work

Department of Mathematics

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

26 Citations (Scopus)

Abstract

The Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplacian matrix. In this paper, we determine those graphs which maximize the Laplacian spectral radius among all bipartite graphs with (edge-)connectivity at most k. We also characterize graphs of order n with k cut-edges, having Laplacian spectral radius equal to n.

Original language	English
Pages (from-to)	99-103
Number of pages	5
Journal	Linear Algebra and Its Applications
Volume	431
Issue number	1-2
DOIs	https://doi.org/10.1016/j.laa.2009.02.013
Publication status	Published - 1 Jul 2009

User-Defined Keywords

Connectivity
Cut-edge
Laplacian spectral radius

Access to Document

10.1016/j.laa.2009.02.013

Cite this

@article{b2bf0521caba4e0390cce7bb395eea2e,

title = "The Laplacian spectral radius of some graphs",

abstract = "The Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplacian matrix. In this paper, we determine those graphs which maximize the Laplacian spectral radius among all bipartite graphs with (edge-)connectivity at most k. We also characterize graphs of order n with k cut-edges, having Laplacian spectral radius equal to n.",

keywords = "Connectivity, Cut-edge, Laplacian spectral radius",

author = "Jianxi Li and Shiu, \{Wai Chee\} and Chan, \{Wai Hong\}",

note = "Funding Information: Partially supported by GRF, Research Grant Council of Hong Kong; FRG, Hong Kong Baptist University. ∗ Corresponding author. E-mail address: [email protected] (W.C. Shiu).",

year = "2009",

month = jul,

day = "1",

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

language = "English",

volume = "431",

pages = "99--103",

journal = "Linear Algebra and Its Applications",

issn = "0024-3795",

publisher = "Elsevier Inc.",

number = "1-2",

}

TY - JOUR

T1 - The Laplacian spectral radius of some graphs

AU - Li, Jianxi

AU - Shiu, Wai Chee

AU - Chan, Wai Hong

N1 - Funding Information: Partially supported by GRF, Research Grant Council of Hong Kong; FRG, Hong Kong Baptist University. ∗ Corresponding author. E-mail address: [email protected] (W.C. Shiu).

PY - 2009/7/1

Y1 - 2009/7/1

N2 - The Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplacian matrix. In this paper, we determine those graphs which maximize the Laplacian spectral radius among all bipartite graphs with (edge-)connectivity at most k. We also characterize graphs of order n with k cut-edges, having Laplacian spectral radius equal to n.

AB - The Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplacian matrix. In this paper, we determine those graphs which maximize the Laplacian spectral radius among all bipartite graphs with (edge-)connectivity at most k. We also characterize graphs of order n with k cut-edges, having Laplacian spectral radius equal to n.

KW - Connectivity

KW - Cut-edge

KW - Laplacian spectral radius

UR - https://www.scopus.com/pages/publications/65049089140

U2 - 10.1016/j.laa.2009.02.013

DO - 10.1016/j.laa.2009.02.013

M3 - Journal article

AN - SCOPUS:65049089140

SN - 0024-3795

VL - 431

SP - 99

EP - 103

JO - Linear Algebra and Its Applications

JF - Linear Algebra and Its Applications

IS - 1-2

ER -

The Laplacian spectral radius of some graphs

Abstract

User-Defined Keywords

Access to Document

Other files and links

Fingerprint

Cite this