Spectral radius and degree sequence of a graph
博士 === 國立交通大學 === 應用數學系所 === 103 === Let G be a simple graph of order n. The spectral radius \rho(G) of G is the largest eigenvalue of its adjacency matrix. For each positive integer l at most n, this dissertation gives a sharp upper bound for \rho(G) by a function of the first l vertex degrees in G...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2015
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/09984986403423769098 |