Pages that link to "Item:Q2521176"
From MaRDI portal
The following pages link to Generating formulas for the number of trees in a graph (Q2521176):
Displayed 11 items.
- On generic forms of complementary graphs (Q1056766) (← links)
- Finding the graph with the maximum number of spanning trees (Q1146688) (← links)
- Tree counting polynomials for labelled graphs. I: Properties (Q1160141) (← links)
- Formulas for the number of trees in certain incomplete graphs (Q1213886) (← links)
- The Fibonacci numbers via trigonometric expressions (Q1214423) (← links)
- On enumerating paths of K arcs in unoriented complete graphs (Q1219305) (← links)
- A certain polynomial of a graph and graphs with an extremal number of trees (Q1393403) (← links)
- On the independent set sequence of a tree (Q2048555) (← links)
- On topological approaches to network theory (Q2523703) (← links)
- Indirect counting trees in linear graphs (Q2557701) (← links)
- Chebyshev polynomials and spanning tree formulas for circulant and related graphs (Q2566290) (← links)