The coefficients of the Ihara zeta function

Involve

Volumn 1, Issue 2, 2008, Pages 217-233

  Scott, Geoffrey ^a   Storm, Christopher ^b  

^a Department of Mathematics ^*  (United States)

^b ADELPHI UNIVERSITY   (United States)

Author keywords

digraph; Eulerian circuit; graph; graph zeta; Ihara zeta; oriented line graph; polynomial coefficient

Indexed keywords

EID: 58349092257     PISSN: 19444176     EISSN: 19444184     Source Type: Journal    
DOI: 10.2140/involve.2008.1.217     Document Type: Article

References (25)

1. [Bass 1992] H. Bass, “The Ihara–Selberg zeta function of a tree lattice”, Internat. J. Math. 3:6 (1992), 717–797. MR 94a:11072 Zbl 0767.11025
2. [Biggs 1994] N. Biggs, Algebraic graph theory, 2nd ed., Cambridge University Press, Cambridge, 1994. MR 95h:05105 Zbl 0797.05032
3. [Brightwell and Winkler 2004] G. R. Brightwell and P. Winkler, “Note on counting eulerian cir-cuits”, preprint, 2004. arXiv cs/0405067
4. [Chartrand and Lesniak 1986] G. Chartrand and L. Lesniak, Graphs and digraphs, 2nd ed., Wads-worth–Brooks/Cole, Monterey, CA, 1986. MR 87h:05001 Zbl 0666.05001
5. [Cooper 2006] Y. Cooper, “Properties determined by the Ihara zeta function of a graph”, preprint, 2006.
6. [Czarneski 2005] D. L. Czarneski, Zeta functions of finite graphs, Ph.D. thesis, Louisiana State Univ., Baton Rouge, 2005.
7. [Harary 1962] F. Harary, “The determinant of the adjacency matrix of a graph”, SIAM Rev. 4 (1962), 202–210. MR 26 #1876 Zbl 0113.17406
8. [Harary 1969a] F. Harary, “Determinants, permanents and bipartite graphs”, Math. Mag. 42 (1969), 146–148. MR 39 #4035 Zbl 0273.15006
9. [Harary 1969b] F. Harary, Graph theory, Addison-Wesley, Reading, MA, 1969. MR 41 #1566 Zbl 0182.57702
10. [Horton 2006] M. D. Horton, Ihara zeta functions of irregular graphs, Ph.D. thesis, University of California, San Diego, 2006.
11. [Horton et al. 2006] M. D. Horton, H. M. Stark, and A. A. Terras, “What are zeta functions of graphs and what are they good for?”, pp. 173–189 in Quantum graphs and their applications (Snowbird, UT, 2005), edited by G. Berkolaiko et al., Contemp. Math. 415, Amer. Math. Soc., Providence, RI, 2006. MR 2007i:05088 Zbl 05082575
12. ℘)”, pp. 272–278 in Algebraic groups and discontinuous subgroups (Boulder, CO, 1965), Amer. Math. Soc., Providence, R.I., 1966. MR 34 #5777 Zbl 0261.20029
13. [Ihara 1966b] Y. Ihara, “On discrete subgroups of the two by two projective linear group over p-adic fields”, J. Math. Soc. Japan 18 (1966), 219–235. MR 36 #6511 Zbl 0158.27702
14. [Jerrum et al. 2004] M. Jerrum, A. Sinclair, and E. Vigoda, “A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries”, J. ACM 51:4 (2004), 671–697. MR 2006b:15013
15. [Kotani and Sunada 2000] M. Kotani and T. Sunada, “Zeta functions of finite graphs”, J. Math. Sci. Univ. Tokyo 7:1 (2000), 7–25. MR 2001f:68110 Zbl 0978.05051
16. bdm/nauty/nug.pdf.
17. [de Mier and Noy 2004] A. de Mier and M. Noy, “On graphs determined by their Tutte polynomi-als”, Graphs Combin. 20:1 (2004), 105–119. MR 2005a:05057 Zbl 1053.05057
18. [Murty 2003] M. R. Murty, “Ramanujan graphs”, J. Ramanujan Math. Soc. 18:1 (2003), 33–52. MR 2004d:11092 Zbl 1038.05038
19. [Noy 2003] M. Noy, “Graphs determined by polynomial invariants”, Theoret. Comput. Sci. 307:2 (2003), 365–384. MR 2004k:05169 Zbl 1048.05072
20. [Stark and Terras 1996] H. M. Stark and A. A. Terras, “Zeta functions of finite graphs and cover-ings”, Adv. Math. 121:1 (1996), 124–165. MR 98b:11094 Zbl 0874.11064
21. [Stark and Terras 2000] H. M. Stark and A. A. Terras, “Zeta functions of finite graphs and coverings, II”, Adv. Math. 154:1 (2000), 132–195. MR 2002f:11123 Zbl 0972.11086
22. [Stein 2008] W. Stein, SAGE reference manual, 2008, Available at http://www.sagemath.org/doc/html/ref/index.html.
23. [Storm 2007] C. Storm, Extending the Ihara–Selberg zeta function to hypergraphs, Ph.D. thesis, Dartmouth College, 2007.
24. [Terras and Stark 2007] A. A. Terras and H. M. Stark, “Zeta functions of finite graphs and coverings, III”, Adv. Math. 208:1 (2007), 467–489. MR 2304325 Zbl 05078979
25. [Valiant 1979] L. G. Valiant, “The complexity of computing the permanent”, Theoret. Comput. Sci. 8:2 (1979), 189–201. MR 80f:68054 Zbl 0415.68008