Oriented hypergraphs: introduction and balance
From MaRDI portal
Publication:396889
zbMATH Open1295.05169arXiv1210.0943MaRDI QIDQ396889FDOQ396889
Authors: Lucas J. Rusnak 
Publication date: 14 August 2014
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1210.0943
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Signed and weighted graphs (05C22) Hypergraphs (05C65) Structural characterization of families of graphs (05C75)
Cites Work
- Title not available (Why is that?)
- Signed graphs
- On the notion of balance of a signed graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Biased graphs. I: Bias, balance, and gains
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Orientation of signed graphs
- Decomposition of balanced matrices
- Alpha-balanced graphs and matrices and GF(3)-representability of matroids
- A characterization of signed hypergraphs and its applications to VLSI via minimization and logic synthesis
- Balanced matrices
- Oriented hypergraphs: introduction and balance
- An oriented hypergraphic approach to algebraic graph theory
Cited In (29)
- Recent results on well-balanced orientations
- Oriented hypergraphic matrix-tree type theorems and bidirected minors via Boolean order ideals
- Oriented hypergraphs: introduction and balance
- Spectra of cycle and path families of oriented hypergraphs
- An oriented hypergraphic approach to algebraic graph theory
- Pruned inside-out polytopes, combinatorial reciprocity theorems and generalized permutahedra
- On positive hypergraphs
- Title not available (Why is that?)
- 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
- The determinant of \(\{\pm 1\}\)-matrices and oriented hypergraphs
- A characterization of oriented hypergraphic balance via signed weak walks
- Spectra of hyperstars
- Binary set systems and totally balanced hypergraphs
- Title not available (Why is that?)
- A characterization of oriented hypergraphic Laplacian and adjacency matrix coefficients
- 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
- Incidence hypergraphs: the categorical inconsistency of set-systems and a characterization of quiver exponentials
- Sharp bounds for the largest eigenvalue
- Graphs, Simplicial Complexes and Hypergraphs: Spectral Theory and Topology
- Coloring the normalized Laplacian for oriented hypergraphs
Uses Software
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)
