arXiv
Open Access
2017
A Characterization of Oriented Hypergraphic Laplacian and Adjacency Matrix Coefficients
Gina Chen
Vivian Liu
Ellen Robinson
Lucas J. Rusnak
Kyle Wang
Abstrak
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.
Topik & Kata Kunci
Penulis (5)
G
Gina Chen
V
Vivian Liu
E
Ellen Robinson
L
Lucas J. Rusnak
K
Kyle Wang
Akses Cepat
Informasi Jurnal
- Tahun Terbit
- 2017
- Bahasa
- en
- Sumber Database
- arXiv
- Akses
- Open Access ✓