An oriented hypergraphic approach to algebraic graph theory

DOI10.1016/J.LAA.2012.06.011MaRDI QIDQ448376zbMATHOpenAlexFDO

Authors Nathan Reff, Lucas J. Rusnak

Publication date 6 September 2012

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1506.05051

zbMATH Keywords

signed graphincidence matrixoriented hypergraphhypergraph adjacency matrixhypergraph Laplacian matrix

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Hypergraphs (05C65)

Abstract: An oriented hypergraph is a hypergraph where each vertex-edge incidence is given a label of $+1$ or $-1$. 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

• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 3409134 (Why is no real title available?)
• An introduction to the theory of graph spectra
• Matrices in the theory of signed simple graphs
• Orientation of signed graphs
• Oriented hypergraphs: introduction and balance

Cited in

(29)

• A connection between Hadamard matrices, oriented hypergraphs and signed graphs
• Algebraic graph theory without orientation
• Oriented hypergraphs: balanceability
• Incidence hypergraphs: the categorical inconsistency of set-systems and a characterization of quiver exponentials
• Spectral theory of weighted hypergraphs via tensors
• 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
• Some bounds on spectral radius of signless Laplacian matrix of k-graphs
• Oriented hypergraphs: introduction and balance
• Oriented hypergraphic matrix-tree type theorems and bidirected minors via Boolean order ideals
• scientific article; zbMATH DE number 7352045 (Why is no real title available?)
• The determinant of \(\{\pm 1\}\)-matrices and oriented hypergraphs
• Spectra of cycle and path families of oriented hypergraphs
• A characterization of oriented hypergraphic balance via signed weak walks
• Coloring the normalized Laplacian for oriented hypergraphs
• Spectral theory of Laplace operators on oriented hypergraphs
• Pruned inside-out polytopes, combinatorial reciprocity theorems and generalized permutahedra
• Graphs, Simplicial Complexes and Hypergraphs: Spectral Theory and Topology
• Generalizing Kirchhoff laws for signed graphs
• Spectral properties of oriented hypergraphs
• Signless normalized Laplacian for hypergraphs
• A Cheeger cut for uniform hypergraphs
• Intersection graphs of oriented hypergraphs and their matrices
• A spectral method to incidence balance of oriented hypergraphs and induced signed hypergraphs
• Lower bounds for the Laplacian spectral radius of an oriented hypergraph
• The signless Laplacian matrix of hypergraphs
• A characterization of oriented hypergraphic Laplacian and adjacency matrix coefficients
• scientific article; zbMATH DE number 1166252 (Why is no real title available?)

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)