@article{46d9c0b9b62245f7aa772057bf6a625d,

title = "A characterization of graphs with rank 5",

abstract = "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.",

keywords = "Adjacency matrix, Graph, Nullity, Rank, Spectrum",

author = "Chang, {Gerard J.} and Huang, {Liang Hao} and Yeh, {Hong Gwa}",

note = "Funding Information: Corresponding author. E-mail addresses: gjchang@math.ntu.edu.tw (G.J. Chang), r90221003@gmail.com (L.-H. Huang), hgyeh@math.ncu.edu.tw (H.-G. Yeh). 1 Partially supported by National Science Council under Grant NSC98-2115-M-002-013-MY3. 2 Partially supported by National Science Council under Grant NSC99-2811-M-008-059. 3 Partially supported by National Science Council under Grant NSC97-2628-M-008-018-MY3.",

year = "2012",

month = jun,

day = "1",

doi = "10.1016/j.laa.2012.01.021",

language = "???core.languages.en_GB???",

volume = "436",

pages = "4241--4250",

journal = "Linear Algebra and Its Applications",

issn = "0024-3795",

number = "11",

}