Let T be the multiplicative group of complex units, and let L(φ) denote a line graph of a T-gain graph φ. Similarly to what happens in the context of signed graphs, the real number min Spec(A(L(φ)), that is, the smallest eigenvalue of the adjacency matrix of L(φ), is not less than -2. The structural conditions on φ ensuring that min Spec(A(L(φ)) = -2 are identified. When such conditions are fulfilled, bases of the -2-eigenspace are constructed with the aid of the star complement technique
AbstractThe main result is that if the smallest eigenvalue of a graph H exceeds a fixed number large...
Abstract. A new proof concerning the determinant of the adjacency matrix of the line graph of a tree...
AbstractIf L(G) is the line graph of G, and A(L(G)), the adjacency matrix of L(G), acts on a vector ...
Let T be the multiplicative group of complex units, and let L(φ) denote a line graph of a T-gain gra...
Let T be the multiplicative group of complex units, and let L (Φ) denote the Laplacian matrix of a n...
Let T4 = (±1, ±i) be the subgroup of fourth roots of unity inside T, the multiplicative group of com...
AbstractA complex unit gain graph is a graph where each orientation of an edge is given a complex un...
Abstract. A complex unit gain graph is a graph where each orientation of an edge is given a complex ...
Let 4 = {±1, ±i} be the subgroup of 4-th roots of unity inside , the multiplicative group of complex...
Let $mathbb{T}_4={ pm 1, pm i}$ be the subgroup of $4$-th roots of unity inside $mathbb{T}$, the mul...
We use star complement technique to construct a basis for −2 of signed line graphs using their root ...
The authors' monographSpectral Generalizations of Line Graphswas published in 2004, following the su...
AbstractA gain graph is a graph where the edges are given some orientation and labeled with the elem...
A complex unit hypergraph is a hypergraph where each vertex-edge incidence is given a complex unit l...
Main result: If the smallest eigenvalue of a graph H exceeds a fixed number larger than the smallest...
AbstractThe main result is that if the smallest eigenvalue of a graph H exceeds a fixed number large...
Abstract. A new proof concerning the determinant of the adjacency matrix of the line graph of a tree...
AbstractIf L(G) is the line graph of G, and A(L(G)), the adjacency matrix of L(G), acts on a vector ...
Let T be the multiplicative group of complex units, and let L(φ) denote a line graph of a T-gain gra...
Let T be the multiplicative group of complex units, and let L (Φ) denote the Laplacian matrix of a n...
Let T4 = (±1, ±i) be the subgroup of fourth roots of unity inside T, the multiplicative group of com...
AbstractA complex unit gain graph is a graph where each orientation of an edge is given a complex un...
Abstract. A complex unit gain graph is a graph where each orientation of an edge is given a complex ...
Let 4 = {±1, ±i} be the subgroup of 4-th roots of unity inside , the multiplicative group of complex...
Let $mathbb{T}_4={ pm 1, pm i}$ be the subgroup of $4$-th roots of unity inside $mathbb{T}$, the mul...
We use star complement technique to construct a basis for −2 of signed line graphs using their root ...
The authors' monographSpectral Generalizations of Line Graphswas published in 2004, following the su...
AbstractA gain graph is a graph where the edges are given some orientation and labeled with the elem...
A complex unit hypergraph is a hypergraph where each vertex-edge incidence is given a complex unit l...
Main result: If the smallest eigenvalue of a graph H exceeds a fixed number larger than the smallest...
AbstractThe main result is that if the smallest eigenvalue of a graph H exceeds a fixed number large...
Abstract. A new proof concerning the determinant of the adjacency matrix of the line graph of a tree...
AbstractIf L(G) is the line graph of G, and A(L(G)), the adjacency matrix of L(G), acts on a vector ...