The minimum rank of universal adjacency matrices (Q448355): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q112882197, #quickstatements; #temporary_batch_1712261475387 |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1112.1718 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Zero forcing sets and the minimum rank of graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Gewirtz graph: An exercise in the theory of graph spectra / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3998725 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The minimum rank of symmetric matrices described by a graph: a survey / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Universal adjacency matrices with two eigenvalues / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Laplacian matrices of graphs: A survey / rank | |||
Normal rank | |||
Latest revision as of 16:19, 5 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The minimum rank of universal adjacency matrices |
scientific article |
Statements
The minimum rank of universal adjacency matrices (English)
0 references
6 September 2012
0 references
adjacency matrix
0 references
universal adjacency matrix
0 references
Laplacian matrix
0 references
minimum universal rank
0 references
graph
0 references
path
0 references
cycle
0 references
