An oriented hypergraphic approach to algebraic graph theory

DOI10.1016/J.LAA.2012.06.011zbMATH Open1247.05164arXiv1506.05051OpenAlexW2094200485MaRDI QIDQ448376FDOQ448376

Authors: Nathan Reff, Lucas J. Rusnak 

Publication date: 6 September 2012

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

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.

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

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

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)

Cites Work

• Title not available (Why is that?)
• Matrices in the theory of signed simple graphs
• An introduction to the theory of graph spectra
• Title not available (Why is that?)
• Orientation of signed graphs
• Oriented hypergraphs: introduction and balance

Cited In (29)

• Title not available (Why is that?)
• 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
• The signless Laplacian matrix of hypergraphs
• A Cheeger cut for uniform hypergraphs
• Some bounds on spectral radius of signless Laplacian matrix of k-graphs
• Pruned inside-out polytopes, combinatorial reciprocity theorems and generalized permutahedra
• Algebraic graph theory without orientation
• 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
• Title not available (Why is that?)
• A characterization of oriented hypergraphic Laplacian and adjacency matrix coefficients
• Signless normalized Laplacian for hypergraphs
• Oriented hypergraphs: balanceability
• Incidence hypergraphs: injectivity, uniformity, and matrix-tree theorems
• Some bounds for the incidence \(Q\)-spectral radius of uniform hypergraphs
• Spectral properties of oriented hypergraphs
• Lower bounds for the Laplacian spectral radius of an oriented hypergraph
• A connection between Hadamard matrices, oriented hypergraphs and signed graphs
• Intersection graphs of oriented hypergraphs and their matrices
• 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
• Graphs, Simplicial Complexes and Hypergraphs: Spectral Theory and Topology
• Coloring the normalized Laplacian for oriented hypergraphs
• Generalizing Kirchhoff laws for signed graphs

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)