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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A sharp upper bound on the maximal entry in the principal eigenvector of symmetric nonnegative matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3655118 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4899902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3254327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp bounds on the distance spectral radius and the distance energy of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3512064 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2875217 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal entries in the principal eigenvector of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The distance spectrum of the path<i>P<sub>n</sub></i>and The First Distance Eigenvector of Connected Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4397004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3184803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the bounds of maximal entries in the principal eigenvector of symmetric nonnegative matrix / rank
 
Normal rank

Latest revision as of 02:22, 5 July 2024

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
    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
    0 references
    0 references