Results 11 to 20 of about 38,642 (200)
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
On the determinant of the Laplacian matrix of a complex unit gain graph
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wang, Yi, Gong, Shi-Cai, Fan, Yi-Zheng
openaire +3 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}$.
Lu, Yong, Wu, Qi
openaire +2 more sources
The rank of a complex unit gain graph in terms of the matching number [PDF]
A complex unit gain graph (or ${\mathbb T}$-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 C:|z|=1 \}$ and a gain function $ : \overrightarrow{E} \rightarrow \mathbb{T}$ with the property that $ (e_{
Shengjie He, Rong-Xia Hao, Fengming Dong
openaire +2 more sources
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
The rank of a complex unit gain graph in terms of the rank of its underlying graph [PDF]
Let $ =(G, )$ be a complex unit gain graph (or $\mathbb{T}$-gain graph) and $A( )$ be its adjacency matrix, where $G$ is called the underlying graph of $ $. The rank of $ $, denoted by $r( )$, is the rank of $A( )$. Denote by $ (G)=|E(G)|-|V(G)|+ (G)$ the dimension of cycle spaces of $G$, where $|E(G)|$, $|V(G)|$ and $ (G)$ are the number of
Yong Lu, Ligong Wang, Qiannan Zhou
openaire +2 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
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
Time after time – circadian clocks through the lens of oscillator theory
Oscillator theory bridges physics and circadian biology. Damped oscillators require external drivers, while limit cycles emerge from delayed feedback and nonlinearities. Coupling enables tissue‐level coherence, and entrainment aligns internal clocks with environmental cues.
Marta del Olmo +2 more
wiley +1 more source

