On graphs with at least three distance eigenvalues less than \(-1\) (Q2250948): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3642517 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3743333 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance spectral radius of trees with given matching number / 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: Complete multipartite graphs are determined by their distance spectra / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distance spectrum of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance spectral radius of digraphs with given connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The distance spectrum of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the least distance eigenvalue of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some graft transformations and its application on a distance spectrum / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distance spectral radius of some graphs / rank
 
Normal rank

Latest revision as of 18:27, 8 July 2024

scientific article
Language Label Description Also known as
English
On graphs with at least three distance eigenvalues less than \(-1\)
scientific article

    Statements

    Identifiers