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 matrices for a quaternion unit gain graph and study their properties. These properties generalize several fundamental results from spectral graph theory of ordinary graphs, signed graphs and complex unit gain graphs. Bounds for both the left and right eigenvalues of the adjacency and Laplacian matrix are developed, and the right eigenvalues for the cycle and path graphs are explicitly calculated
AbstractWe apply the Lefschetz Fixed Point Theorem to show that every square matrix over the quatern...
With every graph (or digraph) one can associate several different matrices. Here we shall concentrat...
AbstractIt is proved that graph Zn is determined by its adjacency spectrum as well as its Laplacian ...
A quaternion unit gain graph is a graph where each orientation of an edge is given a quaternion unit...
Abstract. A complex unit gain graph is a graph where each orientation of an edge is given a complex ...
AbstractA complex unit gain graph is a graph where each orientation of an edge is given a complex un...
A complex unit hypergraph is a hypergraph where each vertex-edge incidence is given a complex unit l...
AbstractA gain graph is a graph where the edges are given some orientation and labeled with the elem...
Gain graphs are graphs where the edges are given some orientation and labeled with the elements (cal...
Taking a Fiedler’s result on the spectrum of a matrix formed from two symmetric matrices as a motiv...
In this BSc thesis we deal with matrix graph theory. We are interested primarily in the eigenvalues ...
AbstractLet AG and DG be respectively the adjacency matrix and the degree matrix of a graph G. The s...
AbstractFor any integer n greater than or equal to two, two intimately related graphs on the vertice...
This paper considers non-Hermitian matrices as well. Throughout, the real numbers are denoted by R, ...
Let 4 = {±1, ±i} be the subgroup of 4-th roots of unity inside , the multiplicative group of complex...
AbstractWe apply the Lefschetz Fixed Point Theorem to show that every square matrix over the quatern...
With every graph (or digraph) one can associate several different matrices. Here we shall concentrat...
AbstractIt is proved that graph Zn is determined by its adjacency spectrum as well as its Laplacian ...
A quaternion unit gain graph is a graph where each orientation of an edge is given a quaternion unit...
Abstract. A complex unit gain graph is a graph where each orientation of an edge is given a complex ...
AbstractA complex unit gain graph is a graph where each orientation of an edge is given a complex un...
A complex unit hypergraph is a hypergraph where each vertex-edge incidence is given a complex unit l...
AbstractA gain graph is a graph where the edges are given some orientation and labeled with the elem...
Gain graphs are graphs where the edges are given some orientation and labeled with the elements (cal...
Taking a Fiedler’s result on the spectrum of a matrix formed from two symmetric matrices as a motiv...
In this BSc thesis we deal with matrix graph theory. We are interested primarily in the eigenvalues ...
AbstractLet AG and DG be respectively the adjacency matrix and the degree matrix of a graph G. The s...
AbstractFor any integer n greater than or equal to two, two intimately related graphs on the vertice...
This paper considers non-Hermitian matrices as well. Throughout, the real numbers are denoted by R, ...
Let 4 = {±1, ±i} be the subgroup of 4-th roots of unity inside , the multiplicative group of complex...
AbstractWe apply the Lefschetz Fixed Point Theorem to show that every square matrix over the quatern...
With every graph (or digraph) one can associate several different matrices. Here we shall concentrat...
AbstractIt is proved that graph Zn is determined by its adjacency spectrum as well as its Laplacian ...