The Nullity of Bicyclic Graphs in Terms of Their Matching Number

• 作 者: Rula SA An CHANG Jianxi LI
• 机 构: CollegeofScience,CenterforDiscreteMathematicsandTheoreticalComputerScience,DepartmentofMathematicsan
• 出 处: 数学研究及应用：英文版
• 发表日期: 2016年6期
• 基金项目: Supported by the National Natural Science Foundation of China （Grant Nos. 11331003, 11471077）.The authors would like to thank the anonymous referees for their constructive corrections and valuable com

Let G be a graph with n(G) vertices and m(G) be its matching number.The nullity of G,denoted by η(G),is the multiplicity of the eigenvalue zero of adjacency matrix of G.It is well known that if G is a tree,then η(G) = n(G)-2m(G).Guo et al.[Jiming GUO,Weig