Complexity of discrete Seifert foliations over a graph

DOI10.1134/S1064562419030141zbMath1426.05081OpenAlexW2955182234MaRDI QIDQ2332088

Young Soo Kwon, Alexander Mednykh, Ilya A. Mednykh

Publication date: 1 November 2019

Published in: Doklady Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1064562419030141

zbMATH Keywords

generalized Petersen graphsdiscrete Seifert foliations

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Foliations (differential geometric aspects) (53C12) Connectivity (05C40)

Related Items (1)

Plans' periodicity theorem for Jacobian of circulant graphs

Cites Work

• Asymptotics and arithmetical properties of complexity for circulant graphs
• Smith normal form and Laplacians
• The asymptotic number of spanning trees in circulant graphs
• Spanning tree formulas and Chebyshev polynomials
• Symmetric Y-graphs and H-graphs
• Counting spanning trees in cobordism of two circulant graphs
• On Jacobian group and complexity of the generalized Petersen graph \(\mathrm{GP}(n,k)\) through Chebyshev polynomials
• A FORMULA FOR THE NUMBER OF SPANNING TREES IN CIRCULANT GRAPHS WITH NONFIXED GENERATORS AND DISCRETE TORI
• Spanning trees on graphs and lattices inddimensions
• On Jacobian group and complexity of I-graph I(n, k, l) through Chebyshev polynomials
• Spanning tree generating functions and Mahler measures
• COUNTING SPANNING TREES IN PRISM AND ANTI-PRISM GRAPHS

This page was built for publication: Complexity of discrete Seifert foliations over a graph