|
|||||
|
|
Walks and the spectral radius of graphs |
|
| Authors: | Vladimir Nikiforov |
| Affiliation: | Department of Mathematical Sciences, University of Memphis, Memphis, TN 38152, USA |
| Abstract: | Given a graph G, write μ(G) for the largest eigenvalue of its adjacency matrix, ω(G) for its clique number, and wk(G) for the number of its k-walks. We prove that the inequalities  |
| Keywords: | 15A42 |
| 本文献已被 ScienceDirect 等数据库收录！ | |