The multiplicity of -2 as an eigenvalue of the distance matrix of graphs (Q5030000): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Which graphs are determined by their spectrum? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determination of the inertia of a partitioned Hermitian matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distance spectrum of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inertia and energy of the distance matrix of a connected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the least distance eigenvalue and its applications on the distance spread / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs with at least three distance eigenvalues less than \(-1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral characterizations of almost complete 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 trees / rank
 
Normal rank

Revision as of 00:21, 28 July 2024

scientific article; zbMATH DE number 7474012
Language Label Description Also known as
English
The multiplicity of -2 as an eigenvalue of the distance matrix of graphs
scientific article; zbMATH DE number 7474012

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references