Intersection graphs of oriented hypergraphs and their matrices

MaRDI QIDQ2820199zbMATH OpenFDO

Authors Nathan Reff

Publication date 14 September 2016

Published in The Australasian Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1509.02132, http://ajc.maths.uq.edu.au//pdf/65/ajc_v65_p108.pdf

zbMATH Keywords

oriented hypergraphsbalanced incomplete block designs

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Hypergraphs (05C65)

Abstract: For a given hypergraph, an orientation can be assigned to the vertex-edge incidences. This orientation is used to define the adjacency and Laplacian matrices. In addition to studying these matrices, several related structures are investigated including the incidence dual, the intersection graph (line graph), and the 2-section. A connection is then made between oriented hypergraphs and balanced incomplete block designs.

Recommendations

• An oriented hypergraphic approach to algebraic graph theory
• Oriented hypergraphs: introduction and balance
• A connection between Hadamard matrices, oriented hypergraphs and signed graphs
• Spectral properties of oriented hypergraphs
• Oriented hypergraphs: balanceability

Cited in

(14)

• Spectra of cycle and path families of oriented hypergraphs
• Signed \(k\)-uniform hypergraphs and tensors
• Spectral theory of Laplace operators on oriented hypergraphs
• A spectral method to incidence balance of oriented hypergraphs and induced signed hypergraphs
• The determinant of \(\{\pm 1\}\)-matrices and oriented hypergraphs
• A characterization of oriented hypergraphic Laplacian and adjacency matrix coefficients
• scientific article; zbMATH DE number 7352045 (Why is no real title available?)
• Oriented hypergraphs: balanceability
• Incidence hypergraphs: injectivity, uniformity, and matrix-tree theorems
• Lower bounds for the Laplacian spectral radius of an oriented hypergraph
• A connection between Hadamard matrices, oriented hypergraphs and signed graphs
• Sharp bounds for the largest eigenvalue
• Graphs, Simplicial Complexes and Hypergraphs: Spectral Theory and Topology
• Coloring the normalized Laplacian for oriented hypergraphs

This page was built for publication: Intersection graphs of oriented hypergraphs and their matrices

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