On the rank of a cograph

DOI10.1016/j.laa.2008.03.016zbMath1149.05032OpenAlexW2103680077MaRDI QIDQ929485

Liang-Hao Huang, Hong-Gwa Yeh, Gerard Jennhwa Chang

Publication date: 17 June 2008

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2008.03.016

zbMATH Keywords

joinrankuniontwinscographdecomposable graphcomplement reducible graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Vector spaces, linear dependence, rank, lineability (15A03)

Related Items (12)

The micro-world of cographs ⋮ Multiplicity of eigenvalues of cographs ⋮ Graphs whose adjacency matrices have rank equal to the number of distinct nonzero rows ⋮ Almost controllable graphs and beyond ⋮ Laplacian eigenvalues of equivalent cographs ⋮ Some spectral properties of cographs ⋮ Distance eigenvalues of a cograph and their multiplicities ⋮ Eigenvalue location in cographs ⋮ A feasible method for optimization with orthogonality constraints ⋮ Spectral properties of cographs andP₅-free graphs ⋮ Linear-time algorithm for the matched-domination problem in cographs ⋮ Cographs: eigenvalues and Dilworth number

Cites Work

• Complement reducible graphs
• The rank of a cograph
• Unnamed Item
• Unnamed Item

This page was built for publication: On the rank of a cograph