A characterization of graphs with rank 4
A characterization of graphs with rank 4
复制标题
DOI：
10.1016/j.laa.2010.09.040
复制
发表时间：
2011-04-15
影响因子：
1.1
通讯作者：
Yeh, Hong-Gwa
中科院分区：
文献类型：
--
作者：
Chang, Gerard J.;Huang, Liang-Hao;Yeh, Hong-Gwa
图 G 的秩被定义为其邻接矩阵的秩。在本文中，我们考虑以下问题：秩为 4 的连通图的结构是什么？这个问题在文献中尚未得到完全解答，只知道一些部分结果。在本文中，我们通过完全表征邻接矩阵为 4 的图 G 来解决这个问题。(C) 2010 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 with rank 4? This question has not yet been fully answered in the literature, and only some partial results are known. In this paper we resolve this question by completely characterizing graphs G whose adjacency matrix has rank 4. (C) 2010 Elsevier Inc. All rights reserved.