Pages that link to "Item:Q4731198"

The following pages link to The number of spanning trees in a prism (Q4731198):

Displaying 15 items.

• On the complexity of a class of pyramid graphs and Chebyshev polynomials (Q474169) (← links)
• Spanning tree formulas and Chebyshev polynomials (Q1106235) (← links)
• The neighborhood inclusion structure of a graph (Q1310225) (← links)
• Enumeration of spanning trees in the sequence of Dürer graphs (Q1698483) (← links)
• The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic (Q1999743) (← links)
• A note on the number of spanning trees in a prism graph (Q3826587) (← links)
• Maximizing the number of spanning trees of networks based on cycle basis representation (Q3828018) (← links)
• Maximizing the number of spanning trees of networks based on cycle basis representation (Q4731203) (← links)
• The number of rooted forests in circulant graphs (Q5037930) (← links)
• Complexity of circulant graphs with non-fixed jumps, its arithmetic properties and asymptotics (Q5056827) (← links)
• COUNTING SPANNING TREES IN PRISM AND ANTI-PRISM GRAPHS (Q5121317) (← links)
• Enumeration of spanning trees in prisms of some graphs (Q6113663) (← links)
• On the Jacobian group of a cone over a circulant graph (Q6117337) (← links)
• Cyclic coverings of graphs. Counting rooted spanning forests and trees, Kirchhoff index, and Jacobians (Q6184481) (← links)
• The number of spanning trees in a superprism (Q6561584) (← links)