The graphs with exactly two distance eigenvalues different from \(-1\) and \(-3\) (Q517364): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(9 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10801-016-0718-2 / rank
Normal rank
 
Property / author
 
Property / author: Lu Lu / rank
Normal rank
 
Property / author
 
Property / author: Qiong Xiang Huang / rank
Normal rank
 
Property / author
 
Property / author: Lu Lu / rank
 
Normal rank
Property / author
 
Property / author: Qiong Xiang Huang / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C50 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C12 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C70 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6696843 / rank
 
Normal rank
Property / zbMATH Keywords
 
distance eigenvalue
Property / zbMATH Keywords: distance eigenvalue / rank
 
Normal rank
Property / zbMATH Keywords
 
distance equitable partition
Property / zbMATH Keywords: distance equitable partition / rank
 
Normal rank
Property / zbMATH Keywords
 
friendship graph
Property / zbMATH Keywords: friendship graph / rank
 
Normal rank
Property / zbMATH Keywords
 
distance spectral characterization
Property / zbMATH Keywords: distance spectral characterization / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2468861484 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1606.07551 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs cospectral with a friendship graph or its complement / rank
 
Normal rank
Property / cites work
 
Property / cites work: The graphs with all but two eigenvalues equal to \(\pm 1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3642517 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of conjectures on adjacency eigenvalues 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 graphs with at least three distance eigenvalues less than \(-1\) / 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: Which graphs are determined by their spectrum? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Developments on spectral characterizations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the two largest \(Q\)-eigenvalues of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the least distance eigenvalue of a graph / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10801-016-0718-2 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:08, 9 December 2024

scientific article
Language Label Description Also known as
English
The graphs with exactly two distance eigenvalues different from \(-1\) and \(-3\)
scientific article

    Statements

    The graphs with exactly two distance eigenvalues different from \(-1\) and \(-3\) (English)
    0 references
    0 references
    0 references
    0 references
    23 March 2017
    0 references
    distance eigenvalue
    0 references
    distance equitable partition
    0 references
    friendship graph
    0 references
    distance spectral characterization
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references