The following pages link to On the rank of a cograph (Q929485):
Displaying 11 items.
- A feasible method for optimization with orthogonality constraints (Q101635) (← links)
- Graphs whose adjacency matrices have rank equal to the number of distinct nonzero rows (Q389670) (← links)
- The micro-world of cographs (Q831855) (← links)
- Some spectral properties of cographs (Q906470) (← links)
- Multiplicity of eigenvalues of cographs (Q1671311) (← links)
- Eigenvalue location in cographs (Q1752501) (← links)
- Distance eigenvalues of a cograph and their multiplicities (Q2226412) (← links)
- Cographs: eigenvalues and Dilworth number (Q2317646) (← links)
- Linear-time algorithm for the matched-domination problem in cographs (Q3101607) (← links)
- Spectral properties of cographs and<i>P</i><sub>5</sub>-free graphs (Q4967261) (← links)
- Almost controllable graphs and beyond (Q6056472) (← links)
