节点文献

几个图运算下的图的惯性指数的界(英文)

Boundingthe inertia of graphs under some graph operations

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 曲慧刘伟俊

【Author】 QU Hui;LIU Weijun;Department of Mathematics,Shandong Institute of Business and Technology;Department of Mathematics,Central South University;School of Science,Nantong University;

【机构】 山东工商学院数学学院中南大学数学学院南通大学理学院

【摘要】 图的惯性指数是指三元组In(G)={i+(G),i-(G),i0(G)},其中i+(G),i-(G),i0(G)分别是图的邻接矩阵A(G)的正、负、零特征值的数目(包括重数).得到了包括加一个点、加一条边、剖分一条边、重合2个点、图的联等运算下图的正惯性指数的界.

【Abstract】 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.

【关键词】 图运算邻接矩阵惯性指数
【Key words】 graph operationsadjacency matrixinertia
【基金】 Supported by the Natural Science Foundation of China(11301302;11101245;11271208);the Natural Science Foundation of Shandong Province(BS2013SF009)
  • 【文献出处】 浙江大学学报(理学版) ,Journal of Zhejiang University(Science Edition) , 编辑部邮箱 ,2016年02期
  • 【分类号】O157.5
  • 【下载频次】49
节点文献中: 

本文链接的文献网络图示:

本文的引文网络