Maximal and minimal entry in the principal eigenvector for the distance matrix of a graph (Q409384): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C50 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C12 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 15A42 / 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: 6023613 / rank
 
Normal rank
Property / zbMATH Keywords
 
distance matrix
Property / zbMATH Keywords: distance matrix / rank
 
Normal rank
Property / zbMATH Keywords
 
spectral radius
Property / zbMATH Keywords: spectral radius / rank
 
Normal rank
Property / zbMATH Keywords
 
principal eigenvector
Property / zbMATH Keywords: principal eigenvector / rank
 
Normal rank
Property / zbMATH Keywords
 
diameter of a graph
Property / zbMATH Keywords: diameter of a graph / rank
 
Normal rank

Revision as of 19:13, 29 June 2023

scientific article
Language Label Description Also known as
English
Maximal and minimal entry in the principal eigenvector for the distance matrix of a graph
scientific article

    Statements

    Maximal and minimal entry in the principal eigenvector for the distance matrix of a graph (English)
    0 references
    0 references
    13 April 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    distance matrix
    0 references
    spectral radius
    0 references
    principal eigenvector
    0 references
    diameter of a graph
    0 references