摘要
一个有限简单图的符号差是指其邻接矩阵的符号差,即邻接矩阵的正惯性指数和负惯性指数的差.马海成等猜测一个图的符号差小于等于长度为4k+5圈的个数,大于等于长度为4k+3圈的个数的负值,本文证明了该猜测对边不交圈的图是成立的.
The signature of a finite simple graph is the signature of its adjacency matrix,which is the difference between its positive inertia index and its negative inertia index.Ma et al.conjectured that the signature of a graph is less or equal to the number of cycles with length4 k + 5 and is greater or equal to minus the number of cycles with length 4k + 3.It is shown in this paper that the conjecture holds for edge-disjoint cyclic graphs.
出处
《数学进展》
CSCD
北大核心
2014年第6期863-868,共6页
Advances in Mathematics（China）
基金
Supported by Teaching and Scientific Research Program of Jiuzhou College of Vocation and Technology(No.Yjx201404)
