On the number of spanning trees of a multi-complete/star related graph (Q294864): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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 / zbMATH DE Number
 
Property / zbMATH DE Number: 6594150 / rank
 
Normal rank
Property / zbMATH Keywords
 
counting
Property / zbMATH Keywords: counting / rank
 
Normal rank
Property / zbMATH Keywords
 
maximization
Property / zbMATH Keywords: maximization / rank
 
Normal rank
Property / zbMATH Keywords
 
spanning trees
Property / zbMATH Keywords: spanning trees / rank
 
Normal rank
Property / zbMATH Keywords
 
combinatorial problems
Property / zbMATH Keywords: combinatorial problems / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3941433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5602686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of spanning trees of multi-star related graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A formula for the number of spanning trees of a multi-star related graph / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:50, 12 July 2024

scientific article
Language Label Description Also known as
English
On the number of spanning trees of a multi-complete/star related graph
scientific article

    Statements

    On the number of spanning trees of a multi-complete/star related graph (English)
    0 references
    0 references
    0 references
    16 June 2016
    0 references
    counting
    0 references
    maximization
    0 references
    spanning trees
    0 references
    combinatorial problems
    0 references

    Identifiers