Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Nathan Reff"'
Publikováno v:
Linear Algebra and its Applications. 632:15-49
A quaternion unit gain graph is a graph where each orientation of an edge is given a quaternion unit, which is the inverse of the quaternion unit assigned to the opposite orientation. In this paper we define the adjacency, Laplacian and incidence mat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::52cd8d4f7409e040d67dea4cce0dc01e
https://doi.org/10.1016/j.laa.2021.09.009
https://doi.org/10.1016/j.laa.2021.09.009
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 40, Iss 2, Pp 417-433 (2020)
Let $mathbb{T}_4={ pm 1, pm i}$ be the subgroup of $4$-th roots of unity inside $mathbb{T}$, the multiplicative group of complex units. A complex unit gain graph $Phi$ is a simple graph $Gamma=(V(Gamma)={v_1,dots, v_n},E(Gamma))$ equipped with a map
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1664cf45f19d5af1c5c3dda4171aa208
https://doaj.org/article/e233dad1ccd84450a5824d301840040a
https://doaj.org/article/e233dad1ccd84450a5824d301840040a
Autor:
Nathan Reff, Luke Duttweiler
Publikováno v:
Linear Algebra and its Applications. 578:251-271
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 simultaneously provides a natural definition for a signed adjacency which is use
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b3ed2e9b12a2dacbb82acfddf1350db8
https://doi.org/10.1016/j.laa.2019.05.008
https://doi.org/10.1016/j.laa.2019.05.008
Autor:
Howard Skogman, Nathan Reff
Publikováno v:
Linear Algebra and its Applications. 529:115-125
Matrices associated to oriented hypergraphs produce a connection between signed graphs and Hadamard matrices. The existence of a family of signed graphs that are switching equivalent to − K n and whose adjacency matrices sum to the zero matrix is s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5bc4ea9fb18da0a946e696c4ac892449
https://doi.org/10.1016/j.laa.2017.04.012
https://doi.org/10.1016/j.laa.2017.04.012
Autor:
Nathan Reff
Publikováno v:
Linear Algebra and its Applications. 506:316-328
A theory of orientation on gain graphs (voltage graphs) is developed to generalize the notion of orientation on graphs and signed graphs. Using this orientation scheme, the line graph of a gain graph is studied. For a particular family of gain graphs
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e6c54dbce9918036ad2fa50b296f981c
https://doi.org/10.1016/j.laa.2016.05.040
https://doi.org/10.1016/j.laa.2016.05.040
Autor:
Nathan Reff
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 o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::59705b832e7aaaf80d38676fbe89bf06
Autor:
Nathan Reff
A complex unit gain graph is a graph where each orientation of an edge is given a complex unit, which is the inverse of the complex unit assigned to the opposite orientation. We extend some fundamental concepts from spectral graph theory to complex u
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::332f6153b24764323b3b6b8b35ecd06a
Autor:
Lucas J. Rusnak, Nathan Reff
Publikováno v:
Linear Algebra and its Applications. (9):2262-2270
An oriented hypergraph is a hypergraph where each vertex-edge incidence is given a label of + 1 or - 1 . We define the adjacency, incidence and Laplacian matrices of an oriented hypergraph and study each of them. We extend several matrix results know
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0795f5877ba7c19c47f239d259d40d2a