[PDF][PDF] Lower bounds for the Laplacian spectral radius of an oriented hypergraph.
An oriented hypergraph is a hypergraph where each vertex-edge incidence is given a label
of+ 1 or− 1. This labeling allows one to naturally define adjacencies so the Laplacian matrix …
of+ 1 or− 1. This labeling allows one to naturally define adjacencies so the Laplacian matrix …
[HTML][HTML] Spectra of cycle and path families of oriented hypergraphs
L Duttweiler, N Reff - Linear Algebra and its Applications, 2019 - Elsevier
An oriented hypergraph is a hypergraph where each vertex-edge incidence is given a label
of either+ 1 or− 1. This generalizes signed graphs to a hypergraph setting and …
of either+ 1 or− 1. This generalizes signed graphs to a hypergraph setting and …
Incidence hypergraphs: Injectivity, uniformity, and matrix-tree theorems
W Grilliette, J Reynes, LJ Rusnak - Linear Algebra and its Applications, 2022 - Elsevier
An oriented hypergraph is an oriented incidence structure that allows for the generalization
of graph theoretic concepts to integer matrices through its locally signed graphic …
of graph theoretic concepts to integer matrices through its locally signed graphic …
Incidence hypergraphs: box products & the Laplacian
W Grilliette, LJ Rusnak - arxiv preprint arxiv:2007.01842, 2020 - arxiv.org
The box product and its associated box exponential are characterized for the categories of
quivers (directed graphs), multigraphs, set system hypergraphs, and incidence hypergraphs …
quivers (directed graphs), multigraphs, set system hypergraphs, and incidence hypergraphs …
[HTML][HTML] Signed k-uniform hypergraphs and tensors
G Yu, X Yuan, H Qu - Linear Algebra and its Applications, 2019 - Elsevier
A signed k-graph is a k-graph with an incidence function on each vertex and its incident
edge. In this paper we extend some concepts of the adjacency and Laplacian tensor from k …
edge. In this paper we extend some concepts of the adjacency and Laplacian tensor from k …
A spectral method to incidence balance of oriented hypergraphs and induced signed hypergraphs
Y Wang, W Le, YZ Fan - Linear and Multilinear Algebra, 2022 - Taylor & Francis
ABSTRACT A hypergraph is said to be oriented if each edge-vertex incidence has a label
of+ 1 or− 1. An oriented hypergraph is called incidence balanced if there exists a bipartition …
of+ 1 or− 1. An oriented hypergraph is called incidence balanced if there exists a bipartition …
The determinant of {±1}-matrices and oriented hypergraphs
LJ Rusnak, J Reynes, R Li, E Yan, J Yu - Linear Algebra and its …, 2024 - Elsevier
Abstract The determinants of {±1}-matrices are calculated via the oriented hypergraphic
Laplacian and summing over incidence generalizations of vertex cycle-covers. These cycle …
Laplacian and summing over incidence generalizations of vertex cycle-covers. These cycle …
[PDF][PDF] The Determinant of {±1}-Matrices and Oriented Hypergraphs
LJ Rusnaka, J Reynesa, R Lid, E Yand… - arxiv preprint arxiv …, 2021 - academia.edu
Abstract The determinants of {±1}-matrices are calculated by via the oriented hypergraphic
Laplacian and summing over an incidence generalization of vertex cycle-covers. These …
Laplacian and summing over an incidence generalization of vertex cycle-covers. These …
[PDF][PDF] Applications of Hypergraphic Matrix Minors via Contributors
JEA Reynes - 2021 - digital.library.txstate.edu
Hypergrahic matrix-minors via contributors can be utilized in a variety of ways. Specifically,
this thesis illustrates that they are useful in extending Kirchhoff-type Laws to signed graphs …
this thesis illustrates that they are useful in extending Kirchhoff-type Laws to signed graphs …