Graphs with three distinct distance eigenvalues (Q2698139): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Distance spectra of graphs: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distribution of Laplacian eigenvalues of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring distance matrix polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Addressing the Petersen graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Addressing Problem for Loop Switching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thekth Laplacian eigenvalue of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Moore Graphs with Diameters 2 and 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with at most three distance eigenvalues different from \(-1\) and \(-2\) / 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: Q3184810 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypercubes are determined by their distance spectra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3310648 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multiplicity of -2 as an eigenvalue of the distance matrix of graphs / 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: Q4998162 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance eigenvalues of a cograph and their multiplicities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The graphs with exactly two distance eigenvalues different from \(-1\) and \(-3\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distance spectra of threshold graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The distance spectrum of a tree / 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: Graphs with few distinct \(D\)-eigenvalues determined by their \(D\)-spectra / rank
 
Normal rank

Revision as of 23:05, 31 July 2024

scientific article
Language Label Description Also known as
English
Graphs with three distinct distance eigenvalues
scientific article

    Statements

    Graphs with three distinct distance eigenvalues (English)
    0 references
    0 references
    0 references
    21 April 2023
    0 references
    distance eigenvalues
    0 references
    distinct eigenvalues
    0 references

    Identifiers