A characterization of graphs with rank 5

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

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

55 引文 斯高帕斯(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 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.

原文???core.languages.en_GB???
頁(從 - 到)4241-4250
頁數10
期刊Linear Algebra and Its Applications
436
發行號11
DOIs
出版狀態已出版 - 1 6月 2012

指紋

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

引用此