摘要： 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. 出版者： Amsterdam: Elsevier Inc 出版日期： 2012-06-01 出處： Linear algebra and its applications, 2012-06, Vol.436 (11), p.4241-4250 資源來源： Elsevier ScienceDirect Journals Complete 版權： 2012 Elsevier Inc. 版權： 2015 INIST-CNRS 識別號： ISSN: 0024-3795 識別號： DOI: 10.1016/j.laa.2012.01.021 識別號： CODEN: LAAPAW
