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
 
Importer (talk | contribs)
Changed an Item
Property / author
 
Property / author: Lu Lu / 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

Revision as of 04:29, 1 July 2023

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
    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