Title of article
On the rank of a cograph Original Research Article
Author/Authors
Gerard J. Chang، نويسنده , , Liang-Hao Huang، نويسنده , , Hong-Gwa Yeh، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
5
From page
601
To page
605
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
Union , twins , Join , Cograph , Rank , Complement reducible graph , Decomposable graph
Journal title
Linear Algebra and its Applications
Serial Year
2008
Journal title
Linear Algebra and its Applications
Record number
826022
Link To Document