Graphs whose adjacency matrices have rank equal to the number of distinct nonzero rows (Q389670): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.laa.2012.06.027 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2020746988 / rank | |||
Normal rank | |||
Revision as of 00:24, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graphs whose adjacency matrices have rank equal to the number of distinct nonzero rows |
scientific article |
Statements
Graphs whose adjacency matrices have rank equal to the number of distinct nonzero rows (English)
0 references
21 January 2014
0 references
rank
0 references
adjacency matrix
0 references
reduced adjacency matrix
0 references
reduced graph
0 references
number of distinct nonzero rows
0 references
cograph
0 references
neighborhood equivalence classes
0 references
