Connectivity and minimal distance spectral radius of graphs (Q3090722): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distance matrix of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Bounds on the Complexity of the Shortest Path Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance matrix polynomials of trees / 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

Latest revision as of 10:00, 4 July 2024

scientific article
Language Label Description Also known as
English
Connectivity and minimal distance spectral radius of graphs
scientific article

    Statements

    Identifiers