A formula for the number of spanning trees of a multi-star related graph (Q293471): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / author
 
Property / author: M. Dambrine / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C30 / 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 / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C78 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6590806 / rank
 
Normal rank
Property / zbMATH Keywords
 
combinatorial problems
Property / zbMATH Keywords: combinatorial problems / rank
 
Normal rank
Property / zbMATH Keywords
 
spanning trees
Property / zbMATH Keywords: spanning trees / rank
 
Normal rank
Property / zbMATH Keywords
 
multi-star graph
Property / zbMATH Keywords: multi-star graph / rank
 
Normal rank

Revision as of 20:19, 27 June 2023

scientific article
Language Label Description Also known as
English
A formula for the number of spanning trees of a multi-star related graph
scientific article

    Statements

    A formula for the number of spanning trees of a multi-star related graph (English)
    0 references
    0 references
    0 references
    9 June 2016
    0 references
    combinatorial problems
    0 references
    spanning trees
    0 references
    multi-star graph
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references