Some properties of graphs determined by edge zeta functions

DOI10.1016/j.laa.2010.11.011zbMath1204.05095arXiv0708.1923MaRDI QIDQ624533

Christopher K. Storm

Publication date: 9 February 2011

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0708.1923

zbMATH Keywords

Hamiltonian cycles; clique number; perfect graph; Ihara zeta function; edge zeta function

Mathematics Subject Classification ID

05C38: Paths and cycles

11M41: Other Dirichlet series and zeta functions

05C99: Graph theory

Related Items

Graph characterization by counting sink star subgraphs

Uses Software

• nauty
• SageMath

Cites Work

• The strong perfect graph theorem
• The coefficients of the Ihara zeta function
• Recognizing claw-free perfect graphs
• Spectral diameter estimates for \(k\)-regular graphs
• Which graphs are determined by their spectrum?
• A note on the zeta function of a graph
• Zeta functions of finite graphs and coverings. II
• Zeta functions of finite graphs and coverings
• Properties determined by the Ihara zeta function of a graph
• On discrete subgroups of the two by two projective linear group over \(p\)-adic fields
• ON ZETA AND L-FUNCTIONS OF FINITE GRAPHS
• Algebraic Graph Theory
• THE IHARA-SELBERG ZETA FUNCTION OF A TREE LATTICE
• Can One Hear the Shape of a Drum?
• On hearing the shape of a drum
• Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item