几个图运算下的图的惯性指数的界（英文）  

Boundingthe inertia of graphs under some graph operations

作　　者：曲慧[1] 刘伟俊[2,3] 

机构地区：[1]山东工商学院数学学院,山东烟台264005 [2]中南大学数学学院,湖南长沙410083 [3]南通大学理学院,江苏南通226019

出　　处：《浙江大学学报（理学版）》2016年第2期134-137,189,共5页Journal of Zhejiang University（Science Edition）

基　　金：Supported by the Natural Science Foundation of China(11301302;11101245;11271208);the Natural Science Foundation of Shandong Province(BS2013SF009)

摘　　要：图的惯性指数是指三元组In(G)={i+(G),i-(G),i0(G)},其中i+(G),i-(G),i0(G)分别是图的邻接矩阵A(G)的正、负、零特征值的数目(包括重数).得到了包括加一个点、加一条边、剖分一条边、重合2个点、图的联等运算下图的正惯性指数的界.The inertia of a graph Gis defined to be the triple In（G）= {i＋（G）,i-（G）,i0（G）},where i＋（G）,i-（G）,i0（G）are the numbers of positive,negative and zero eigenvalues of the adjacency matrix A（G）including multiplicities,respectively.Some bounds for the positive index of inertia of a graph under some graph operations including adding a vertex or an edge,subdivision of an edge,contracting of two vertices and the join of graphs,are obtained.

关 键 词：图运算 邻接矩阵 惯性指数 

分 类 号：O157.5[理学—数学]