Pages that link to "Item:Q1160141"
From MaRDI portal
The following pages link to Tree counting polynomials for labelled graphs. I: Properties (Q1160141):
Displaying 6 items.
- Counting trees in directed regular multigraphs (Q757413) (← links)
- The asymptotic number of spanning trees in circulant graphs (Q965958) (← links)
- An efficient approach for counting the number of spanning trees in circulant and related graphs (Q966019) (← links)
- On generic forms of complementary graphs (Q1056766) (← links)
- Nonisomorphic graphs with the same t-polynomial (Q1089010) (← links)
- Chebyshev polynomials and spanning tree formulas for circulant and related graphs (Q2566290) (← links)
