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
Line and Subdivision Graphs Determined by
Let T 4 = { ± 1 , ± i } be the subgroup of fourth roots of unity inside T , the multiplicative group of complex units. For a T 4 -gain graph Φ = ( Γ , T 4 , φ ) , we introduce gain functions on ...
Abdullah Alazemi +4 more
doaj +1 more source
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 +3 more sources
Spectral Characterizations of Complex Unit Gain Graphs
While eigenvalues of graphs are well studied, spectral analysis of complex unit gain graphs is still in its infancy. This thesis considers gain graphs whose gain groups are gradually less and less restricted, with the ultimate goal of classifying gain graphs that are characterized by their spectra. In such cases, the eigenvalues of a gain graph contain
openaire +1 more source
Bounds for the rank of a complex unit gain graph in terms of the independence number [PDF]
arXiv admin note: substantial text overlap with arXiv:1907.07837, arXiv:1909 ...
He, Shengjie, Hao, Rong-Xia, Yu, Aimei
openaire +2 more sources
On eigenspaces of some compound complex unit gain graphs
Summary: Let \(\mathbb{T}\) be the multiplicative group of complex units, and let \(L(\Phi)\) denote the Laplacian matrix of a nonempty \(\mathbb{T}\)-gain graph \(\Phi = (\Gamma, \mathbb{T}, \gamma)\). The gain line graph \(\mathcal{L}(\Phi)\) and the gain subdivision graph \(\mathcal{S}(\Phi)\) are defined up to switching equivalence.
Belardo F., Brunetti M.
openaire +2 more sources
Inertia indices of a complex unit gain graph in terms of matching number
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}$. Let $A(G^φ)$ be adjacency
Lu, Yong, Wu, Qi
openaire +2 more sources
A Bibliometric Analysis of Publications in Uremic Toxins From 1991 to 2024
ABSTRACT Background Uremic toxins are a growing area of research in nephrology, with significant implications in the progression and treatment of chronic kidney disease (CKD) and the management of end‐stage kidney disease (ESKD). This bibliometric analysis aims to evaluate the global research trends, key contributors, and the impact of publications in ...
Yuh‐Shan Ho +7 more
wiley +1 more source
Enteropathogenic E. coli (EPEC) infects the human intestinal epithelium, resulting in severe illness and diarrhoea. In this study, we compared the infection of cancer‐derived cell lines with human organoid‐derived models of the small intestine. We observed a delayed in attachment, inflammation and cell death on primary cells, indicating that host ...
Mastura Neyazi +5 more
wiley +1 more source

