Constructing isospectral non-isomorphic digraphs from hypergraphs

DOI10.1002/JGT.20423MaRDI QIDQ5190333zbMATH OpenOpenAlexFDO

Authors 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

hypergraphisospectral digraphoriented line graphzeta function

Mathematics Subject Classification ID

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

Recommendations

• An iterative construction of isospectral digraphs
• scientific article; zbMATH DE number 3968633
• On Isospectral Graphs.
• scientific article; zbMATH DE number 2182883
• Zeta-equivalent digraphs: simultaneous cospectrality

Cites work

• Can One Hear the Shape of a Drum?
• Constructing cospectral graphs
• Developments on spectral characterizations of graphs
• scientific article; zbMATH DE number 1495995 (Why is no real title available?)
• scientific article; zbMATH DE number 1522565 (Why is no real title available?)
• The zeta function of a hypergraph
• Which graphs are determined by their spectrum?
• Zeta functions of finite graphs and coverings

Cited in

(3)

• An iterative construction of isospectral digraphs
• A note on the spectral characterization of strongly connected bicyclic digraphs
• On the oriented line graph.

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

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