On the characteristic polynomials of graphs with nullity n-4
返回论文页
|更新时间:2023-12-11
|
On the characteristic polynomials of graphs with nullity n-4
Acta Scientiarum Naturalium Universitatis SunYatseniVol. 55, Issue 6, Pages: 57-63(2016)
作者机构:
1. 青海民族大学数学与统计学院,青海,西宁,810007
2.
作者简介:
基金信息:
DOI:
CLC:
Published:2016,
Published Online:25 November 2016,
扫 描 看 全 文
WU Tingzeng, FENG Lihua, MA Haicheng. On the characteristic polynomials of graphs with nullity n-4. [J]. Acta Scientiarum Naturalium Universitatis SunYatseni 55(6):57-63(2016)
DOI:
WU Tingzeng, FENG Lihua, MA Haicheng. On the characteristic polynomials of graphs with nullity n-4. [J]. Acta Scientiarum Naturalium Universitatis SunYatseni 55(6):57-63(2016)DOI:
On the characteristic polynomials of graphs with nullity n-4
n 个顶点的图G的零度等于 n 减去其邻接矩阵的秩。计算了零度为 n-4 的所有图的特征多项式。特别地
证明了许多零度为 n-4 的图是谱唯一确定的
并构造了许多对零度为 n-4 的同谱图。
Abstract
The nullity of a graph is the multiplicity of zeroes in its adjacency spectrum. And the nullity of a graph G with n vertices equals to n minus the rank of adjacency matrix of G. The characteristic polynomials of graphs with nullity n-4 is computed. In particular
it is shown that some graphs with nullity n-4 are determined by their spectra. And some pairs of cospectral graphs with nullity n-4 are presented.