Intersection graphs of oriented hypergraphs and their matrices
From MaRDI portal
Publication:2820199
zbMATH Open1344.05103arXiv1509.02132MaRDI QIDQ2820199FDOQ2820199
Publication date: 14 September 2016
Published in: The Australasian Journal of Combinatorics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1509.02132
Recommendations
Combinatorial aspects of block designs (05B05) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Hypergraphs (05C65)
Cited In (13)
- Spectra of cycle and path families of oriented hypergraphs
- Signed \(k\)-uniform hypergraphs and tensors
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- A characterization of oriented hypergraphic Laplacian and adjacency matrix coefficients
- Incidence hypergraphs: injectivity, uniformity, and matrix-tree theorems
- 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)
