Spectral properties of oriented hypergraphs

DOI10.13001/1081-3810.1625MaRDI QIDQ5501676zbMATH OpenOpenAlexFDO

Authors Nathan Reff

Publication date 14 August 2015

Published in The Electronic Journal of Linear Algebra (Search for Journal in Brave)

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

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

hypergraph adjacency matrixhypergraph Laplacianhypergraph Laplacian eigenvalueshypergraph spectraoriented hypergraphsigned graphsignless Laplacian

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Hypergraphs (05C65)

Abstract: An oriented hypergraph is a hypergraph where each vertex-edge incidence is given a label of $+1$ or $-1$. The adjacency and Laplacian eigenvalues of an oriented hypergraph are studied. Eigenvalue bounds for both the adjacency and Laplacian matrices of an oriented hypergraph which depend on structural parameters of the oriented hypergraph are found. An oriented hypergraph and its incidence dual are shown to have the same nonzero Laplacian eigenvalues. A family of oriented hypergraphs with uniformally labeled incidences is also studied. This family provides a hypergraphic generalization of the signless Laplacian of a graph and also suggests a natural way to define the adjacency and Laplacian matrices of a hypergraph. Some results presented generalize both graph and signed graph results to a hypergraphic setting.

Recommendations

• Spectra of cycle and path families of oriented hypergraphs
• Lower bounds for the Laplacian spectral radius of an oriented hypergraph
• An oriented hypergraphic approach to algebraic graph theory
• The signless Laplacian matrix of hypergraphs
• A characterization of oriented hypergraphic Laplacian and adjacency matrix coefficients

Cited in

(29)

• Coloring the normalized Laplacian for oriented hypergraphs
• Principal eigenvector of the signless Laplacian matrix
• 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
• Oriented hypergraphs: balanceability
• \(p\)-Laplace operators for oriented hypergraphs
• Adjacency energy of hypergraphs
• The signless Laplacian matrix of hypergraphs
• Signed k-uniform hypergraphs and tensors
• Spectra of cycle and path families of oriented hypergraphs
• A connection between Hadamard matrices, oriented hypergraphs and signed graphs
• Orientation spectra of cubic graphs
• Intersection graphs of oriented hypergraphs and their matrices
• An oriented hypergraphic approach to algebraic graph theory
• scientific article; zbMATH DE number 7352045 (Why is no real title available?)
• Graphs, Simplicial Complexes and Hypergraphs: Spectral Theory and Topology
• Spectra of hyperstars
• Lower bounds for the Laplacian spectral radius of an oriented hypergraph
• A spectral method to incidence balance of oriented hypergraphs and induced signed hypergraphs
• Some properties on eccentricity matrices of uniform hypertrees
• 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

This page was built for publication: Spectral properties of oriented hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501676)