On graphs whose third largest distance eigenvalue dose not exceed \(-1\) (Q2242780): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse of the distance matrix of a block graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the first eigenvalue of bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On bounds for the index of double nested graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some new considerations about double nested graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3642517 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distance spectrum of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a property of the class of n-colorable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distance spectrum of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the second largest distance eigenvalue of a block graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the second largest distance eigenvalue / rank
 
Normal rank

Latest revision as of 03:29, 27 July 2024

scientific article
Language Label Description Also known as
English
On graphs whose third largest distance eigenvalue dose not exceed \(-1\)
scientific article

    Statements

    On graphs whose third largest distance eigenvalue dose not exceed \(-1\) (English)
    0 references
    0 references
    0 references
    0 references
    10 November 2021
    0 references
    0 references
    third largest eigenvalue
    0 references
    distance matrix
    0 references
    distance spectra
    0 references
    chain graph
    0 references
    0 references