Enumeration of spanning trees in prisms of some graphs (Q6113663): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The number of spanning trees in a prism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning tree formulas and Chebyshev polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4684252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4470240 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Number of spanning trees of different products of complete and complete bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of products of some complete and complete bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A certain polynomial of a graph and graphs with an extremal number of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of some classes of pyramid graphs created from a gear graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4791752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5331504 / rank
 
Normal rank
Property / cites work
 
Property / cites work: COUNTING SPANNING TREES IN PRISM AND ANTI-PRISM GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chebyshev polynomials and spanning tree formulas for circulant and related graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3937404 / rank
 
Normal rank

Revision as of 16:10, 1 August 2024

scientific article; zbMATH DE number 7710066
Language Label Description Also known as
English
Enumeration of spanning trees in prisms of some graphs
scientific article; zbMATH DE number 7710066

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references