On Hadamard diagonalizable graphs (Q551311): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(6 intermediate revisions by 6 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1016/j.laa.2011.03.033 / rank | |||
Property / author | |||
Property / author: Sumit K. Garg / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C50 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 15A18 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 5924558 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
graph | |||
Property / zbMATH Keywords: graph / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Laplacian matrix | |||
Property / zbMATH Keywords: Laplacian matrix / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Hadamard matrix | |||
Property / zbMATH Keywords: Hadamard matrix / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
adjacency matrix | |||
Property / zbMATH Keywords: adjacency matrix / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Hadamard diagonalizable graph | |||
Property / zbMATH Keywords: Hadamard diagonalizable graph / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
cograph | |||
Property / zbMATH Keywords: cograph / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.laa.2011.03.033 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1967520751 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: \(\{-1,0,1\}\)-basis for the null space of a forest / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Laplacian eigenvectors of graphs. Perron-Frobenius and Faber-Krahn type theorems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Complement reducible graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On graphs whose Laplacian matrices have distinct integer eigenvalues / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On graphs with algebraic connectivity equal to minimum edge density / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5682350 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Laplacian Spectrum of a Graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Retracts of strong products of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Laplacian matrices of graphs: A survey / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A survey of graph laplacians / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Laplacian graph eigenvectors / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Laplace eigenvalues of graphs---a survey / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fast generation of regular graphs and construction of cages / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On certain eigenspaces of cographs / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.LAA.2011.03.033 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 22:18, 9 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On Hadamard diagonalizable graphs |
scientific article |
Statements
On Hadamard diagonalizable graphs (English)
0 references
15 July 2011
0 references
graph
0 references
Laplacian matrix
0 references
Hadamard matrix
0 references
adjacency matrix
0 references
Hadamard diagonalizable graph
0 references
cograph
0 references