Graphs whose adjacency matrices have rank equal to the number of distinct nonzero rows (Q389670)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Graphs whose adjacency matrices have rank equal to the number of distinct nonzero rows |
scientific article; zbMATH DE number 6248195
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graphs whose adjacency matrices have rank equal to the number of distinct nonzero rows |
scientific article; zbMATH DE number 6248195 |
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
