A characterization of graphs with rank 5
A characterization of graphs with rank 5
复制标题
DOI：
10.1016/j.laa.2012.01.021
复制
发表时间：
2012-06-01
影响因子：
1.1
通讯作者：
Yeh, Hong-Gwa
中科院分区：
文献类型：
--
作者：
Chang, Gerard J.;Huang, Liang-Hao;Yeh, Hong-Gwa
图 G 的秩被定义为其邻接矩阵的秩。在本文中，我们考虑以下问题：秩为 5 的连通图 G 的结构是什么？或者等效地，邻接矩阵具有 n - 5 无效性的 n 顶点连通图 G 的结构是什么？在本文中，我们完全表征了邻接矩阵为 5 级的连通图 G。 (C) 2012 Elsevier Inc. 保留所有权利。
The rank of a graph G is defined to be the rank of its adjacency matrix. In this paper, we consider the following problem: what is the structure of a connected graph G with rank 5? or equivalently, what is the structure of a connected n-vertex graph G whose adjacency matrix has nullity n - 5? In this paper, we completely characterize connected graphs G whose adjacency matrix has rank 5. (C) 2012 Elsevier Inc. All rights reserved.