On The Largest Eigenvalues of Bipartite Graphs
碩士 === 國立交通大學 === 應用數學系所 === 93 === Let G be a graph and A(G) be the adjacency matrix of G. The characcteristic polynomial of G, denoted by PG(x), is det ( xI - A(G ) ) where I is the identity matrix. The eigenvalues of a graph are the eigenvalues of its adjacency matrix. In this thesis, we study th...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2005
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/35893929237559462125 |