Pages that link to "Item:Q2361566"

The following pages link to On Jacobian group and complexity of the generalized Petersen graph \(\mathrm{GP}(n,k)\) through Chebyshev polynomials (Q2361566):

Displaying 12 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)
• Iwasawa theory of Jacobians of graphs (Q2097189) (← links)
• Determining the edge metric dimension of the generalized Petersen graph \(P(n, 3)\) (Q2125226) (← links)
• Plans' periodicity theorem for Jacobian of circulant graphs (Q2243871) (← 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)
• Cyclic coverings of graphs. Counting rooted spanning forests and trees, Kirchhoff index, and Jacobians (Q6184481) (← links)