Restricted to the bicyclic graphs with prescribed degree sequences, we determine the (unique) graph with the largest spectral radius with respect to the adjacency matrix.
Spectral Radius and Degree Sequence
β Scribed by M. Hofmeister
- Publisher
- John Wiley and Sons
- Year
- 1988
- Tongue
- English
- Weight
- 310 KB
- Volume
- 139
- Category
- Article
- ISSN
- 0025-584X
No coin nor oath required. For personal study only.
β¦ Synopsis
For a nonregular graph there is exactly one value of p such that the p-mean of its degree sequence is equal to the spectral radius. We try to investigate the structural content of this so-called spectral mean characteristic; in particular, me characterize the connected graphs of spectral mean characteristic 2.
π SIMILAR VOLUMES
Let K 1 , . . . , K n be (infinite) non-negative matrices that define operators on a Banach sequence space. Given a function f : ) of n variables, we define a nonnegative matrix f (K 1 , . . . , K n ) and consider the inequality where r denotes the spectral radius. We find the largest function f fo