ON THE CHARACTERIZATION OF GRAPHS WITH PENDENT VERTICES AND GIVEN NULLITY

被引：0
|
作者：
Liu, Bolian [1 ]
Huang, Yufei [1 ]
Chen, Siyuan [1 ]
机构：
[1] S China Normal Univ, Sch Math Sci, Guangzhou 510631, Guangdong, Peoples R China
来源：
ELECTRONIC JOURNAL OF LINEAR ALGEBRA | 2009年 / 18卷
关键词：
Eigenvalue; Nullity; Pendent vertex;
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Let G be a graph with n vertices. The nullity of G, denoted by eta(G), is the multiplicity of the eigenvalue zero in its spectrum. In this paper, we characterize the graphs (resp. bipartite graphs) with pendent vertices and nullity eta, where 0 < eta <= n. Moreover, the minimum (resp. maximum) number of edges for all (connected) graphs with pendent vertices and nullity eta are determined, and the extremal graphs are characterized.
引用
收藏
页码：719 / 734
页数：16
相关论文
共 50 条
12345