Upper bounds for the number of spanning trees of graphs (Q387931): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / author
 
Property / author: H. S. Yoon / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C50 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6239054 / rank
 
Normal rank
Property / zbMATH Keywords
 
graph
Property / zbMATH Keywords: graph / rank
 
Normal rank
Property / zbMATH Keywords
 
spanning trees
Property / zbMATH Keywords: spanning trees / rank
 
Normal rank
Property / zbMATH Keywords
 
normalized Laplacian eigenvalues
Property / zbMATH Keywords: normalized Laplacian eigenvalues / rank
 
Normal rank

Revision as of 14:21, 29 June 2023

scientific article
Language Label Description Also known as
English
Upper bounds for the number of spanning trees of graphs
scientific article

    Statements

    Upper bounds for the number of spanning trees of graphs (English)
    0 references
    0 references
    0 references
    17 December 2013
    0 references
    0 references
    graph
    0 references
    spanning trees
    0 references
    normalized Laplacian eigenvalues
    0 references