Combinatorial analysis by the Ihara zeta function of graphs

zbMATH Open1176.68142MaRDI QIDQ3397686FDOQ3397686

Authors: Angel Garrido 

Publication date: 22 September 2009

Recommendations

• Ihara zeta functions of digraphs
• What are zeta functions of graphs and what are they good for?
• scientific article; zbMATH DE number 1821773
• An Ihara formula for partially directed graphs
• Asymptotic behaviour of essential graphs

zbMATH Keywords

graph theoryasymptotic analysisenumeration of graphsgraph labeling

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Other Dirichlet series and zeta functions (11M41)

Cited In (2)

• Combinatorics of the zeta map on rational Dyck paths
• The Ihara zeta function of the complement of a semiregular bipartite graph

This page was built for publication: Combinatorial analysis by the Ihara zeta function of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3397686)