A characterization of oriented hypergraphic Laplacian and adjacency matrix coefficients
From MaRDI portal
Publication:1669013
DOI10.1016/j.laa.2018.07.012zbMath1394.05070arXiv1704.03599OpenAlexW2605550497MaRDI QIDQ1669013
Ellen Robinson, Vivian Liu, Gina Chen, Lucas J. Rusnak, Kyle Wang
Publication date: 29 August 2018
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1704.03599
Hypergraphs (05C65) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Signed and weighted graphs (05C22)
Related Items (13)
Oriented hypergraphs: balanceability ⋮ Graphs, Simplicial Complexes and Hypergraphs: Spectral Theory and Topology ⋮ Unnamed Item ⋮ Incidence hypergraphs: the categorical inconsistency of set-systems and a characterization of quiver exponentials ⋮ Generalizing Kirchhoff laws for Signed Graphs ⋮ Coloring the normalized Laplacian for oriented hypergraphs ⋮ Unnamed Item ⋮ Spectral theory of Laplace operators on oriented hypergraphs ⋮ Sharp bounds for the largest eigenvalue ⋮ Incidence hypergraphs: injectivity, uniformity, and matrix-tree theorems ⋮ Oriented hypergraphic matrix-tree type theorems and bidirected minors via Boolean order ideals ⋮ Spectra of cycle and path families of oriented hypergraphs ⋮ On the normalized Laplacian permanental polynomial of a graph
Cites Work
- Oriented hypergraphs: introduction and balance
- Spectral properties of complex unit gain graphs
- An oriented hypergraphic approach to algebraic graph theory
- Combinatorial approach for computing the characteristic polynomial of a matrix
- A characterization of oriented hypergraphic balance via signed weak walks
- Erratum to: T. Zaslavsky, signed graphs
- Orientation of signed graphs
- A characterization of signed hypergraphs and its applications to VLSI via minimization and logic synthesis
- Decomposition of balanced matrices
- On blow-ups and injectivity of quivers
- On the Laplacian coefficients of signed graphs
- Balanced matrices
- A deletion-contraction algorithm for the characteristic polynomial of a multigraph
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A characterization of oriented hypergraphic Laplacian and adjacency matrix coefficients