Results 1 to 10 of about 319,037 (217)
NEPS of complex unit gain graphs [PDF]
A complex unit gain graph (or $\mathbb T$-gain graph) is a gain graph with gains in $\mathbb T$, the multiplicative group of complex units. Extending a classical construction for simple graphs due to Cvektovic, suitably defined noncomplete extended $p$-sums (NEPS, for short) of $\mathbb T$-gain graphs are considered in this paper. Structural properties
Francesco Belardo +2 more
openaire +5 more sources
Gain distance matrices for complex unit gain graphs
A complex unit gain graph ($ \mathbb{T} $-gain graph), $ =(G, ) $ is a graph where the function $ $ assigns a unit complex number to each orientation of an edge of $ G $, and its inverse is assigned to the opposite orientation. %A complex unit gain graph($ \mathbb{T} $-gain graph) is a simple graph where each orientation of an edge is given a ...
Aniruddha Samanta, M. Rajesh Kannan
exaly +9 more sources
Balancedness and the Least Laplacian Eigenvalue of Some Complex Unit Gain Graphs
Let 𝕋4 = {±1, ±i} be the subgroup of 4-th roots of unity inside 𝕋, the multiplicative group of complex units. A complex unit gain graph Φ is a simple graph Γ = (V (Γ) = {v1, . . .
Belardo Francesco +2 more
doaj +4 more sources
Spectral properties of complex unit gain graphs [PDF]
13 pages, 1 figure, to appear in Linear Algebra ...
Nathan Reff
openaire +5 more sources
Eigenvalues of complex unit gain graphs and gain regularity
A complex unit gain graph (or T{\mathbb{T}}-gain graph) Γ=(G,γ)\Gamma =\left(G,\gamma ) is a gain graph with gains in T{\mathbb{T}}, the multiplicative group of complex units.
Brunetti Maurizio
doaj +3 more sources
Unit gain graphs with two distinct eigenvalues and systems of lines in complex space
Since the introduction of the Hermitian adjacency matrix for digraphs, interest in so-called complex unit gain graphs has surged. In this work, we consider gain graphs whose spectra contain the minimum number of two distinct eigenvalues. Analogously to graphs with few distinct eigenvalues, a great deal of structural symmetry is required for a gain ...
Wissing, Pepijn, van Dam, Edwin R.
openaire +5 more sources
Bounds for the energy of a complex unit gain graph [PDF]
A $\mathbb{T}$-gain graph, $ = (G, )$, is a graph in which the function $ $ assigns a unit complex number to each orientation of an edge, and its inverse is assigned to the opposite orientation. The associated adjacency matrix $ A( ) $ is defined canonically.
Aniruddha Samanta, M. Rajesh Kannan
openaire +3 more sources
Line graphs of complex unit gain graphs with least eigenvalue -2
Let $\mathbb T$ be the multiplicative group of complex units, and let $\mathcal L (\Phi)$ denote a line graph of a $\mathbb{T}$-gain graph $\Phi$. Similarly to what happens in the context of signed graphs, the real number $\min Spec(A(\mathcal L (\Phi))$, that is, the smallest eigenvalue of the adjacency matrix of $\mathcal L(\Phi)$, is not less than $-
Belardo F., Brunetti M.
openaire +4 more sources
On the adjacency matrix of a complex unit gain graph [PDF]
A complex unit gain graph is a simple graph in which each orientation of an edge is given a complex number with modulus 1 and its inverse is assigned to the opposite orientation of the edge. In this article, first we establish bounds for the eigenvalues of the complex unit gain graphs.
Ranjit Mehatari +2 more
openaire +2 more sources
Metagenomic sequencing is an increasingly common tool in environmental and biomedical sciences. While software for detailing the composition of microbial communities using 16S rRNA marker genes is relatively mature, increasingly researchers are ...
Mike W.C. Thang +4 more
doaj +1 more source

