Back to Search Start Over

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

Authors :
Huang, Peng
Shiu, Wai Chee
Sun, Pak Kiu
Source :
Linear Algebra & its Applications. Jan2016, Vol. 488, p350-362. 13p.
Publication Year :
2016

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 . [ABSTRACT FROM AUTHOR]

Subjects

Subjects :
*SPECTRAL theory
*RADIUS (Geometry)
*GRAPH connectivity
*DIAMETER
*EIGENVALUES
*MATRICES (Mathematics)

Details

Language :
English
ISSN :
00243795
Volume :
488
Database :
Academic Search Index
Journal :
Linear Algebra & its Applications
Publication Type :
Academic Journal
Accession number :
110741398
Full Text :
https://doi.org/10.1016/j.laa.2015.09.057
Full Text Access
View/download PDF

Tools

Authors Abstract Subjects Details