On the two largest distance eigenvalues of graph powers (Q503610): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
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: 05C05 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6674422 / rank
 
Normal rank
Property / zbMATH Keywords
 
combinatorial problems
Property / zbMATH Keywords: combinatorial problems / rank
 
Normal rank
Property / zbMATH Keywords
 
distance eigenvalues
Property / zbMATH Keywords: distance eigenvalues / rank
 
Normal rank
Property / zbMATH Keywords
 
\(k\)-th power of a graph
Property / zbMATH Keywords: \(k\)-th power of a graph / rank
 
Normal rank
Property / zbMATH Keywords
 
tree
Property / zbMATH Keywords: tree / rank
 
Normal rank
Property / zbMATH Keywords
 
unicyclic graph
Property / zbMATH Keywords: unicyclic graph / rank
 
Normal rank

Revision as of 00:59, 1 July 2023

scientific article
Language Label Description Also known as
English
On the two largest distance eigenvalues of graph powers
scientific article

    Statements

    On the two largest distance eigenvalues of graph powers (English)
    0 references
    0 references
    0 references
    13 January 2017
    0 references
    combinatorial problems
    0 references
    distance eigenvalues
    0 references
    \(k\)-th power of a graph
    0 references
    tree
    0 references
    unicyclic graph
    0 references

    Identifiers