On cospectrality of gain graphs
Special Matrices, 2022 We define GG-cospectrality of two GG-gain graphs (Γ,ψ)\left(\Gamma ,\psi ) and (Γ′,ψ′)\left(\Gamma ^{\prime} ,\psi ^{\prime} ), proving that it is a switching isomorphism invariant.
Cavaleri Matteo, Donno Alfredo
doaj +4 more sources
On two Laplacian matrices for skew gain graphs [PDF]
Electronic Journal of Graph Theory and Applications, 2021 Gain graphs are graphs where the edges are given some orientation and labeled with the elements (called gains) from a group so that gains are inverted when we reverse the direction of the edges.
Roshni T. Roy +2 more
doaj +3 more sources
Line and Subdivision Graphs Determined by
Mathematics, 2019 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 +2 more sources
Normalized Laplacians for gain graphs [PDF]
The American Journal of Combinatorics, 2022 We propose the notion of normalized Laplacian matrix $\mathcal{L}(\Phi)$ for a gain graph $\Phi$ and study its properties in detail, providing insights and counterexamples along the way.
M. Rajesh Kannan +2 more
doaj +5 more sources
Cross-residual knowledge graph learning for robust multi-trait gene–trait prioritization in rice [PDF]
Frontiers in Plant ScienceIntroductionPrioritizing genes associated with agronomic traits remains challenging because relevant evidence is distributed across heterogeneous biological resources and curated gene-trait associations are incomplete.MethodsWe formulate multi-trait crop
Jingchao Wang +8 more
doaj +2 more sources
IEEE Access, 2023 Various graph neural networks (GNNs) have been proposed to solve node classification tasks in machine learning for graph data. GNNs use the structural information of graph data by aggregating the feature vectors of neighboring nodes.
Yuga Oishi, Ken Kaneiwa
doaj +3 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 +3 more sources
Correlation-Induced Accessibility Bridges in Biomedical Networks: A Proof-of-Concept Relational Graph Model [PDF]
EntropyComplex diseases often involve distributed interactions among biological regions, physiological systems, imaging phenotypes, and clinical variables that are not fully captured by anatomical proximity, isolated biomarkers, or conventional feature-based ...
Roxana Irina Iancu +11 more
doaj +2 more sources
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 ...
Ligong Wang, Qiannan Zhou
exaly +4 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-Zheng Fan
exaly +3 more sources