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

零度为$n-7$的双圈符号图
引用本文:李国君,余爱梅.零度为$n-7$的双圈符号图[J].数学研究及应用,2015,35(1):1-10.
作者姓名:李国君  余爱梅
作者单位:北京交通大学数学系 北京 100044;北京交通大学数学系 北京 100044
基金项目:国家自然科学基金(Grant Nos.11101027; 11371193),中央高校基本科研业务费专项资金(Grant No.2011JBM136).
摘    要:Let Γ be a signed graph and A(Γ) be the adjacency matrix of Γ. The nullity ofΓ is the multiplicity of eigenvalue zero in the spectrum of A(Γ). In this paper, the connected bicyclic signed graphs(including simple bicyclic graphs) of order n with nullity n-7 are completely characterized.

关 键 词:nullity  signed  graph  bicyclic  graph  adjacency  matrix
收稿时间:2/8/2014 12:00:00 AM
修稿时间:2014/10/13 0:00:00

A Characterization of Bicyclic Signed Graphs with Nullity $n-7$
Guojun LI and Aimei YU.A Characterization of Bicyclic Signed Graphs with Nullity $n-7$[J].Journal of Mathematical Research with Applications,2015,35(1):1-10.
Authors:Guojun LI and Aimei YU
Institution:Department of Mathematics, Beijing Jiaotong University, Beijing 100044, P. R. China;Department of Mathematics, Beijing Jiaotong University, Beijing 100044, P. R. China
Abstract:Let $\Gamma$ be a signed graph and $A(\Gamma)$ be the adjacency matrix of $\Gamma$. The nullity of $\Gamma$ is the multiplicity of eigenvalue zero in the spectrum of $A(\Gamma)$. In this paper, the connected bicyclic signed graphs (including simple bicyclic graphs) of order $n$ with nullity $n-7$ are completely characterized.
Keywords:nullity  signed graph  bicyclic graph  adjacency matrix
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《数学研究及应用》浏览原始摘要信息
点击此处可从《数学研究及应用》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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