Indexed by:
Abstract:
In this paper, we first present the properties of the graph which maximize the spectral radius among all graphs with prescribed degree sequence. Using these results, we provide a somewhat simpler method to determine the unicyclic graph with maximum spectral radius among all unicyclic graphs with a given degree sequence. Moreover, we determine the bicyclic graph which has maximum spectral radius among all bicyclic graphs with a given degree sequence.
Keyword:
Reprint 's Address:
Email:
Source :
Kyungpook Mathematical Journal
ISSN: 1225-6951
Year: 2014
Issue: 3
Volume: 54
Page: 425-441
0 . 6 0 0
JCR@2023
Cited Count:
SCOPUS Cited Count:
ESI Highly Cited Papers on the List: 0 Unfold All
WanFang Cited Count:
Chinese Cited Count:
30 Days PV: 2
Affiliated Colleges: