Results 11 to 20 of about 29,130 (196)
On the adjacency matrix of a complex unit gain graph [PDF]
Linear and Multilinear Algebra, 2020 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
F1000Research, 2019 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
The rank of a complex unit gain graph in terms of the rank of its underlying graph [PDF]
Journal of Combinatorial Optimization, 2019 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 edges ...
Yong Lu, Ligong Wang 0001, Qiannan Zhou
openaire +2 more sources
The rank of a complex unit gain graph in terms of the matching number [PDF]
Linear Algebra and its Applications, 2020 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_{i,j})=
Shengjie He, Rong-Xia Hao, Fengming Dong
openaire +2 more sources
On the determinant of the Laplacian matrix of a complex unit gain graph
Discrete Mathematics, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yi Wang, Shi-Cai Gong, Yi-Zheng Fan
openaire +1 more source
Bounds for the rank of a complex unit gain graph in terms of the independence number [PDF]
Linear and Multilinear Algebra, 2020 arXiv admin note: substantial text overlap with arXiv:1907.07837, arXiv:1909 ...
He, Shengjie, Hao, Rong-Xia, Yu, Aimei
openaire +2 more sources
Spectral Characterizations of Complex Unit Gain Graphs
, 2022 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
On eigenspaces of some compound complex unit gain graphs
, 2021 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
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}$. 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
Therapeutic Apheresis and Dialysis, EarlyView.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