A characterization of oriented hypergraphic Laplacian and adjacency matrix coefficients
From MaRDI portal
Publication:1669013
DOI10.1016/J.LAA.2018.07.012zbMATH Open1394.05070arXiv1704.03599OpenAlexW2605550497MaRDI QIDQ1669013FDOQ1669013
Authors: Gina Chen, Vivian Liu, Ellen Robinson, Lucas J. Rusnak, Kyle Wang 
Publication date: 29 August 2018
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Abstract: An oriented hypergraph is an oriented incidence structure that generalizes and unifies graph and hypergraph theoretic results by examining its locally signed graphic substructure. In this paper we obtain a combinatorial characterization of the coefficients of the characteristic polynomials of oriented hypergraphic Laplacian and adjacency matrices via a signed hypergraphic generalization of basic figures of graphs. Additionally, we provide bounds on the determinant and permanent of the Laplacian matrix, characterize the oriented hypergraphs in which the upper bound is sharp, and demonstrate that the lower bound is never achieved.
Full work available at URL: https://arxiv.org/abs/1704.03599
Recommendations
- \(p\)-Laplace operators for oriented hypergraphs
- The coefficients of Laplacian characteristic polynomials of graphs
- scientific article; zbMATH DE number 475375
- scientific article; zbMATH DE number 1839816
- A lattice-theoretical characterization of oriented matroids
- The properties of some coefficients of the characteristic and the Laplacian polynomial of a hypergraph
- Lower bounds for the Laplacian spectral radius of an oriented hypergraph
- An oriented hypergraphic approach to algebraic graph theory
- Intersection graphs of oriented hypergraphs and their matrices
- On the Laplacian Eigenvalues and Metric Parameters of Hypergraphs
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Signed and weighted graphs (05C22) Hypergraphs (05C65)
Cites Work
- On the Laplacian coefficients of signed graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Combinatorial approach for computing the characteristic polynomial of a matrix
- Spectral properties of complex unit gain graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Orientation of signed graphs
- Decomposition of balanced matrices
- Title not available (Why is that?)
- Erratum to: T. Zaslavsky, signed graphs
- 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
- A deletion-contraction algorithm for the characteristic polynomial of a multigraph
- A characterization of oriented hypergraphic balance via signed weak walks
- On blow-ups and injectivity of quivers
Cited In (19)
- Oriented hypergraphic matrix-tree type theorems and bidirected minors via Boolean order ideals
- Spectra of cycle and path families of oriented hypergraphs
- An oriented hypergraphic approach to algebraic graph theory
- Spectral theory of Laplace operators on oriented hypergraphs
- The determinant of \(\{\pm 1\}\)-matrices and oriented hypergraphs
- A characterization of oriented hypergraphic balance via signed weak walks
- Spectra of hyperstars
- Title not available (Why is that?)
- The properties of some coefficients of the characteristic and the Laplacian polynomial of a hypergraph
- Oriented hypergraphs: balanceability
- Incidence hypergraphs: injectivity, uniformity, and matrix-tree theorems
- Spectral properties of oriented hypergraphs
- Lower bounds for the Laplacian spectral radius of an oriented hypergraph
- On the normalized Laplacian permanental polynomial of a graph
- 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
- Generalizing Kirchhoff laws for signed graphs
This page was built for publication: A characterization of oriented hypergraphic Laplacian and adjacency matrix coefficients
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1669013)
