A generalization of a graph theory Mertens' theorem: Galois covering case
From MaRDI portal
Publication:1748353
DOI10.1515/forum-2016-0060zbMath1441.11257OpenAlexW2748357328MaRDI QIDQ1748353
Takehiro Hasegawa, Seiken Saito, Iwao Sato
Publication date: 9 May 2018
Published in: Forum Mathematicum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/forum-2016-0060
Asymptotic results on counting functions for algebraic and topological structures (11N45) Enumeration in graph theory (05C30) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On graph theory Mertens' theorems
- Mertens' theorem for arithmetic progressions
- On a prime zeta function of a graph
- A note on Mertens' formula for arithmetic progressions
- A GENERALIZATION OF A GRAPH THEORY MERTENS’ THEOREM: ABELIAN COVERING CASE
This page was built for publication: A generalization of a graph theory Mertens' theorem: Galois covering case