Maximizing the spectral radius of k-connected graphs with given diameter

Peng Huang; Wai Chee Shiu; Pak Kiu Sun

doi:10.1016/j.laa.2015.09.057

Maximizing the spectral radius of k-connected graphs with given diameter

Peng Huang^*
, Wai Chee Shiu
, Pak Kiu Sun

^*Corresponding author for this work

Department of Mathematics

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

9 Citations (Scopus)

Abstract

The spectral radius of a graph is the largest eigenvalue of its adjacency matrix. P. Hansen and D. Stevanović (2008) [9] determined the graphs with maximum spectral radius among all connected graphs of order n with diameter D. In this paper, we generalize this result to k-connected graphs of order n with diameter D.

Original language	English
Pages (from-to)	350-362
Number of pages	13
Journal	Linear Algebra and Its Applications
Volume	488
DOIs	https://doi.org/10.1016/j.laa.2015.09.057
Publication status	Published - 1 Jan 2016

User-Defined Keywords

MSC 05C50

Access to Document

10.1016/j.laa.2015.09.057

Cite this

@article{73a6fc9fcb964db28620d0742aaa65ae,

title = "Maximizing the spectral radius of k-connected graphs with given diameter",

abstract = "The spectral radius of a graph is the largest eigenvalue of its adjacency matrix. P. Hansen and D. Stevanovi{\'c} (2008) [9] determined the graphs with maximum spectral radius among all connected graphs of order n with diameter D. In this paper, we generalize this result to k-connected graphs of order n with diameter D.",

keywords = "MSC 05C50",

author = "Peng Huang and Shiu, \{Wai Chee\} and Sun, \{Pak Kiu\}",

note = "Funding Information: Supported by GRF of Hong Kong ( HKBU202413 ), FRG of Hong Kong Baptist University ( FRG 2/14-15/012 ). ",

year = "2016",

month = jan,

day = "1",

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

language = "English",

volume = "488",

pages = "350--362",

journal = "Linear Algebra and Its Applications",

issn = "0024-3795",

publisher = "Elsevier Inc.",

}

TY - JOUR

T1 - Maximizing the spectral radius of k-connected graphs with given diameter

AU - Huang, Peng

AU - Shiu, Wai Chee

AU - Sun, Pak Kiu

N1 - Funding Information: Supported by GRF of Hong Kong ( HKBU202413 ), FRG of Hong Kong Baptist University ( FRG 2/14-15/012 ).

PY - 2016/1/1

Y1 - 2016/1/1

N2 - The spectral radius of a graph is the largest eigenvalue of its adjacency matrix. P. Hansen and D. Stevanović (2008) [9] determined the graphs with maximum spectral radius among all connected graphs of order n with diameter D. In this paper, we generalize this result to k-connected graphs of order n with diameter D.

AB - The spectral radius of a graph is the largest eigenvalue of its adjacency matrix. P. Hansen and D. Stevanović (2008) [9] determined the graphs with maximum spectral radius among all connected graphs of order n with diameter D. In this paper, we generalize this result to k-connected graphs of order n with diameter D.

KW - MSC 05C50

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

U2 - 10.1016/j.laa.2015.09.057

DO - 10.1016/j.laa.2015.09.057

M3 - Journal article

AN - SCOPUS:84944088730

SN - 0024-3795

VL - 488

SP - 350

EP - 362

JO - Linear Algebra and Its Applications

JF - Linear Algebra and Its Applications

ER -

Maximizing the spectral radius of k-connected graphs with given diameter

Abstract

User-Defined Keywords

Access to Document

Other files and links

Fingerprint

Cite this