ON THE LEAST EIGENVALUE OF A GRAPH

1993Mathematics被引 4

摘要

Let G be a simple graph with n vertices and λ_n(G) be the least eigenvalue of G. In this paper, we show that, if G is connected but not complete, then λ_n(G)≤λ_n(K_(n-1)~1) and the equality holds if and only if G K_(n-1)~1, where K_(n-1)~1, is the graph obtained by the coalescence of a complete graph K_(n-1) of n-1 vertices with a path P_2 of length one of its vertices.

引用本文（GB/T 7714）

Hong Yuan. ON THE LEAST EIGENVALUE OF A GRAPH[J]. 未知来源, 1993.

引文网络

参考文献与被引分析加载中…

本站仅收录题录与摘要供学习参考，全文版权归属出版方；如有侵权请联系我们删除。