COUNTING SPANNING TREES IN PRISM AND ANTI-PRISM GRAPHS (Q5121317): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.11948/2016006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2179119116 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local characteristics, entropy and limit theorems for spanning trees and domino tilings via transfer-impedances / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of spanning trees in a prism / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees on the Sierpinski gasket / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted spanning trees on some self-similar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5625213 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic Enumeration of Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting spanning trees in self-similar networks by evaluating determinants / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of spanning trees in \(K_ n\)-complements of quasi-threshold graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The problem of the optimal biobjective spanning tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees on graphs and lattices in<i>d</i>dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dimers on a simple-quartic net with a vacancy / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of spanning trees in self-similar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determinant identities for Laplace matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of spanning trees on various lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning Trees and Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of spanning trees in planar unclustered networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of spanning trees in Apollonian networks / rank
 
Normal rank

Latest revision as of 14:03, 23 July 2024

scientific article; zbMATH DE number 7246721
Language Label Description Also known as
English
COUNTING SPANNING TREES IN PRISM AND ANTI-PRISM GRAPHS
scientific article; zbMATH DE number 7246721

    Statements

    COUNTING SPANNING TREES IN PRISM AND ANTI-PRISM GRAPHS (English)
    0 references
    0 references
    0 references
    0 references
    14 September 2020
    0 references
    electrically equivalent transformation
    0 references
    spanning trees
    0 references
    prism graph
    0 references
    anti-prism graph
    0 references

    Identifiers