Pages that link to "Item:Q4629559"
From MaRDI portal
The following pages link to On Jacobian group and complexity of I-graph I(n, k, l) through Chebyshev polynomials (Q4629559):
Displayed 10 items.
- Counting rooted spanning forests in cobordism of two circulant graphs (Q779138) (← links)
- Counting spanning trees in cobordism of two circulant graphs (Q1615746) (← links)
- The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic (Q1999743) (← links)
- Complexity of the circulant foliation over a graph (Q2025146) (← links)
- Complexity of discrete Seifert foliations over a graph (Q2332088) (← links)
- Counting rooted spanning forests for circulant foliation over a graph (Q2679743) (← 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)
- 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)