Constructing isospectral non‐isomorphic digraphs from hypergraphs

DOI10.1002/jgt.20423zbMath1188.05070OpenAlexW4243231565MaRDI QIDQ5190333

Barry Balof, Christopher K. Storm

Publication date: 15 March 2010

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20423

zbMATH Keywords

hypergraphzeta functionoriented line graphisospectral digraph

Mathematics Subject Classification ID

Hypergraphs (05C65) Directed graphs (digraphs), tournaments (05C20) Graph operations (line graphs, products, etc.) (05C76)

Related Items (2)

A note on the spectral characterization of strongly connected bicyclic digraphs ⋮ An iterative construction of isospectral digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Constructing cospectral graphs
• The zeta function of a hypergraph
• Developments on spectral characterizations of graphs
• Which graphs are determined by their spectrum?
• Zeta functions of finite graphs and coverings
• Can One Hear the Shape of a Drum?

This page was built for publication: Constructing isospectral non‐isomorphic digraphs from hypergraphs