A characterization of graphs with rank 4

Gerard J. Chang, Liang Hao Huang, Hong Gwa Yeh

研究成果: 雜誌貢獻期刊論文同行評審

61 引文 斯高帕斯(Scopus)

摘要

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.

原文???core.languages.en_GB???
頁(從 - 到)1793-1798
頁數6
期刊Linear Algebra and Its Applications
434
發行號8
DOIs
出版狀態已出版 - 15 4月 2011

指紋

深入研究「A characterization of graphs with rank 4」主題。共同形成了獨特的指紋。

引用此