An oriented hypergraphic approach to algebraic graph theory
From MaRDI portal
(Redirected from Publication:448376)
Abstract: An oriented hypergraph is a hypergraph where each vertex-edge incidence is given a label of or . We define the adjacency, incidence and Laplacian matrices of an oriented hypergraph and study each of them. We extend several matrix results known for graphs and signed graphs to oriented hypergraphs. New matrix results that are not direct generalizations are also presented. Finally, we study a new family of matrices that contains walk information.
Recommendations
- Spectra of cycle and path families of oriented hypergraphs
- Spectral properties of oriented hypergraphs
- A characterization of oriented hypergraphic balance via signed weak walks
- Oriented hypergraphs: introduction and balance
- A characterization of oriented hypergraphic Laplacian and adjacency matrix coefficients
Cites work
- An introduction to the theory of graph spectra
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 3409134 (Why is no real title available?)
- Matrices in the theory of signed simple graphs
- Orientation of signed graphs
- Oriented hypergraphs: introduction and balance
Cited in
(33)- Algebraic graph theory without orientation
- A characterization of oriented hypergraphic Laplacian and adjacency matrix coefficients
- Coloring the normalized Laplacian for oriented hypergraphs
- Spectral theory of Laplace operators on oriented hypergraphs
- Sharp bounds for the largest eigenvalue
- Incidence hypergraphs: injectivity, uniformity, and matrix-tree theorems
- Some bounds for the incidence \(Q\)-spectral radius of uniform hypergraphs
- A Cheeger cut for uniform hypergraphs
- Pruned inside-out polytopes, combinatorial reciprocity theorems and generalized permutahedra
- Oriented hypergraphs: balanceability
- The signless Laplacian matrix of hypergraphs
- Oriented hypergraphic matrix-tree type theorems and bidirected minors via Boolean order ideals
- Spectra of cycle and path families of oriented hypergraphs
- A connection between Hadamard matrices, oriented hypergraphs and signed graphs
- Intersection graphs of oriented hypergraphs and their matrices
- Oriented hypergraphs: introduction and balance
- scientific article; zbMATH DE number 1166252 (Why is no real title available?)
- scientific article; zbMATH DE number 7352045 (Why is no real title available?)
- Generalizing Kirchhoff laws for signed graphs
- Graphs, Simplicial Complexes and Hypergraphs: Spectral Theory and Topology
- Signless normalized Laplacian for hypergraphs
- Lower bounds for the Laplacian spectral radius of an oriented hypergraph
- Spectral properties of oriented hypergraphs
- A spectral method to incidence balance of oriented hypergraphs and induced signed hypergraphs
- Incidence hypergraphs: the categorical inconsistency of set-systems and a characterization of quiver exponentials
- Some bounds on spectral radius of signless Laplacian matrix of k-graphs
- Spectral theory of weighted hypergraphs via tensors
- The determinant of \(\{\pm 1\}\)-matrices and oriented hypergraphs
- Coloring outside the lines: spectral bounds for generalized hypergraph colorings
- Nodal domain theorems of signed hypergraphs
- Calculus of variations on hypergraphs
- Spectra of complex unit hypergraphs
- A characterization of oriented hypergraphic balance via signed weak walks
This page was built for publication: An oriented hypergraphic approach to algebraic graph theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q448376)
