首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Walks and the spectral radius of graphs
Authors:Vladimir Nikiforov
Institution: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
View the MathML source
Keywords:15A42
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号