@article{028b1085a8a84fd5b2cb04e2b1c9c03d,
title = "On the rank of a cograph",
abstract = "The rank of a graph is defined to be the rank of its adjacency matrix. Royle [G.F. Royle, The rank of a cograph, Electron. J. Combin. 10 (2003) #N11] proved a somewhat surprising result that the rank of a cograph is equal to the number of distinct non-zero rows of its adjacency matrix. In this paper we answer a question posed by Royle (2003) by giving an elementary short proof for a more general setting of this rank property of cographs.",
keywords = "Cograph, Complement reducible graph, Decomposable graph, Join, Rank, Twins, Union",
author = "Chang, {Gerard J.} and Huang, {Liang Hao} and Yeh, {Hong Gwa}",
note = "Funding Information: E-mail addresses:
[email protected] (G.J. Chang),
[email protected] (L.-H. Huang), hgyeh@math. ncu.edu.tw (H.-G. Yeh). 1 Partially supported by National Science Council of ROC under Grant NSC95-2115-M-002-013-MY3. 2 Partially supported by National Science Council of ROC under Grant NSC95-2115-M-008-005.",
year = "2008",
month = jul,
day = "15",
doi = "10.1016/j.laa.2008.03.016",
language = "???core.languages.en_GB???",
volume = "429",
pages = "601--605",
journal = "Linear Algebra and Its Applications",
issn = "0024-3795",
number = "2-3",
}