Two Laplacians for the distance matrix of a graph (Q389586): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C50 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6248150 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
distance matrix | |||
Property / zbMATH Keywords: distance matrix / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
eigenvalues | |||
Property / zbMATH Keywords: eigenvalues / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Laplacian | |||
Property / zbMATH Keywords: Laplacian / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
signless Laplacian | |||
Property / zbMATH Keywords: signless Laplacian / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
graph | |||
Property / zbMATH Keywords: graph / rank | |||
Normal rank |
Revision as of 13:44, 29 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Two Laplacians for the distance matrix of a graph |
scientific article |
Statements
Two Laplacians for the distance matrix of a graph (English)
0 references
21 January 2014
0 references
distance matrix
0 references
eigenvalues
0 references
Laplacian
0 references
signless Laplacian
0 references
graph
0 references