{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T20:15:48Z","timestamp":1774383348504,"version":"3.50.1"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>The rank of the adjacency matrix of a graph is bounded above by the number of distinct non-zero rows of that matrix. In general, the rank is lower than this number because there may be some non-trivial linear combination of the rows equal to zero.  We show the somewhat surprising result that this never occurs for the class of cographs. Therefore, the rank of a cograph is equal to the number of distinct non-zero rows of its adjacency matrix.<\/jats:p>","DOI":"10.37236\/1751","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T07:03:10Z","timestamp":1578639790000},"source":"Crossref","is-referenced-by-count":25,"title":["The Rank of a Cograph"],"prefix":"10.37236","volume":"10","author":[{"given":"Gordon F.","family":"Royle","sequence":"first","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2003,9,17]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v10i1n11\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v10i1n11\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,18]],"date-time":"2020-01-18T05:06:46Z","timestamp":1579324006000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v10i1n11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9,17]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2003,1,6]]}},"URL":"https:\/\/doi.org\/10.37236\/1751","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,9,17]]},"article-number":"N11"}}