Spectral Radius of a Bipartite Graph
博士 === 國立交通大學 === 應用數學系所 === 106 === The spectral radius of a square matrix C is the largest magnitude of an eigenvalue of C and the spectral radius of a graph G is the spectral radius of the adjacency matrix of G. Let G be a bipartite graph with e edges without isolated vertices. It was known that...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2018
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/69zy7p |