Oriented hypergraphs: introduction and balance
From MaRDI portal
(Redirected from Publication:396889)
Abstract: An oriented hypergraph is an oriented incidence structure that extends the concept of a signed graph. We introduce hypergraphic structures and techniques central to the extension of the circuit classification of signed graphs to oriented hypergraphs. Oriented hypergraphs are further decomposed into three families -- balanced, balanceable, and unbalanceable -- and we obtain a complete classification of the balanced circuits of oriented hypergraphs.
Recommendations
Cites work
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- scientific article; zbMATH DE number 43754 (Why is no real title available?)
- scientific article; zbMATH DE number 1380573 (Why is no real title available?)
- scientific article; zbMATH DE number 3327126 (Why is no real title available?)
- A characterization of signed hypergraphs and its applications to VLSI via minimization and logic synthesis
- Alpha-balanced graphs and matrices and GF(3)-representability of matroids
- An oriented hypergraphic approach to algebraic graph theory
- Balanced matrices
- Biased graphs. I: Bias, balance, and gains
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Decomposition of balanced matrices
- On the notion of balance of a signed graph
- Orientation of signed graphs
- Oriented hypergraphs: introduction and balance
- Signed graphs
Cited in
(29)- Recent results on well-balanced orientations
- Oriented hypergraphs: introduction and balance
- Oriented hypergraphic matrix-tree type theorems and bidirected minors via Boolean order ideals
- An oriented hypergraphic approach to algebraic graph theory
- Spectra of cycle and path families of oriented hypergraphs
- Pruned inside-out polytopes, combinatorial reciprocity theorems and generalized permutahedra
- On positive hypergraphs
- scientific article; zbMATH DE number 4045772 (Why is no real title available?)
- Signed \(k\)-uniform hypergraphs and tensors
- Computational graph completion
- Spectral theory of Laplace operators on oriented hypergraphs
- A spectral method to incidence balance of oriented hypergraphs and induced signed hypergraphs
- A characterization of oriented hypergraphic balance via signed weak walks
- The determinant of \(\{\pm 1\}\)-matrices and oriented hypergraphs
- Spectra of hyperstars
- Binary set systems and totally balanced 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
- Good and nice colorings of balanced hypergraphs
- A connection between Hadamard matrices, oriented hypergraphs and signed graphs
- Characterizing attitudinal network graphs through frustration cloud
- Intersection graphs of oriented hypergraphs and their matrices
- Sharp bounds for the largest eigenvalue
- Incidence hypergraphs: the categorical inconsistency of set-systems and a characterization of quiver exponentials
- Graphs, Simplicial Complexes and Hypergraphs: Spectral Theory and Topology
- Coloring the normalized Laplacian for oriented hypergraphs
This page was built for publication: Oriented hypergraphs: introduction and balance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q396889)
