未找到相关数据
ON THE LEAST EIGENVALUE OF A GRAPH
被引：0
作者：
HONG Yuan Department of Mathematics
机构：
基金：
中国国家自然科学基金;
关键词：
Adjacency matrix;
eigenvalue;
coalescence;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Let G be a simple graph with n vertices and λ(G) be the least eigenvalue of G.In this paper, we show that, if G is connected but not complete, then λ(G)≤λ(K~1)and the equality holds if and only if G K~1, where K~1, is the graph obtained by thecoalescence of a complete graph Kof n-1 vertices with a path Pof length one of itsvertices.
引用
收藏
页码：269 / 272
页数：4
相关论文