Results 1 to 10 of about 42,768 (103)
Balancedness and the Least Laplacian Eigenvalue of Some Complex Unit Gain Graphs
Discussiones Mathematicae Graph Theory, 2020 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 +5 more sources
Eigenvalues of complex unit gain graphs and gain regularity
Special MatricesA 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 +4 more sources
Gain distance matrices for complex unit gain graphs [PDF]
Discrete Mathematics, 2022 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
semanticscholar +8 more sources
NEPS of complex unit gain graphs
The Electronic Journal of Linear Algebra, 2023 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 +4 more sources
Bounds and extremal graphs for the energy of complex unit gain graphs [PDF]
Linear Algebra and its Applications, 2023 A complex unit gain graph ($ \mathbb{T} $-gain graph), $ Φ=(G, φ) $ is a graph where the gain function $ φ$ assigns a unit complex number to each orientation of an edge of $ G $ and its inverse is assigned to the opposite orientation. The associated adjacency matrix $ A(Φ) $ is defined canonically. The energy $ \mathcal{E}(Φ) $ of a $ \mathbb{T} $-gain
Aniruddha Samanta, M. Rajesh Kannan
openaire +3 more sources
Spectral properties of complex unit gain graphs [PDF]
Linear Algebra and its Applications, 2012 13 pages, 1 figure, to appear in Linear Algebra ...
Nathan Reff
openaire +5 more sources
Unit gain graphs with two distinct eigenvalues and systems of lines in complex space [PDF]
Discrete Mathematics, 2022 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 +4 more sources
Inertia indices of a complex unit gain graph in terms of matching number [PDF]
Linear and Multilinear Algebra, 2022 A complex unit gain graph is a triple $ =(G, \mathbb{T}, )$ (or $G^ $ for short) consisting of a simple graph $G$, as the underlying graph of $G^ $, the set of unit complex numbers $\mathbb{T}={z\in \mathbb{C}: |z| = 1}$ and a gain function $ : \overrightarrow{E}\rightarrow \mathbb{T}$ such that $ (e_{i,j})= (e_{j,i}) ^{-1}$.
Lu, Yong, Wu, Qi
openaire +3 more sources
Line graphs of complex unit gain graphs with least eigenvalue -2
The Electronic Journal of Linear Algebra, 2021 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 +5 more sources
Symmetry in complex unit gain graphs and their spectra
Linear Algebra and its Applications, 2023 Complex unit gain graphs may exhibit various kinds of symmetry. In this work, we explore structural symmetry, spectral symmetry and sign-symmetry in such graphs, and their respective relations to one-another. Our main result is a construction that transforms an arbitrary complex unit gain graph into infinitely many switching-distinct ones whose ...
Pepijn Wissing, Edwin R. van Dam
openaire +5 more sources