Results 181 to 190 of about 40,477 (198)

The rank of a complex unit gain graph in terms of the rank and the independence number of its underlying graph

Discrete Applied Mathematics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Qi Wu, Jialei Song, Yong Lu
exaly   +3 more sources

Complex unit gain graphs of rank 2

Linear Algebra and its Applications, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Feng Xu, Qi Zhou, Dein Wong, Fenglei Tian   +3 more
openaire   +2 more sources

Complex unit gain graphs with exactly one positive eigenvalue

Linear Algebra and its Applications, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lu Lu, Jianfeng Wang, Qiongxiang Huang
openaire   +2 more sources

The multiplicity of an \(A_\alpha \)-eigenvalue: a unified approach for mixed graphs and complex unit gain graphs

Discret. Math., 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shuchao Li, Wei Wei
openaire   +3 more sources

On the multiplicity of $Aα$-eigenvalues and the rank of complex unit gain graphs

2021
Let $ Φ=(G, φ) $ be a connected complex unit gain graph ($ \mathbb{T} $-gain graph) on a simple graph $ G $ with $ n $ vertices and maximum vertex degree $ Δ$. The associated adjacency matrix and degree matrix are denoted by $ A(Φ) $ and $ D(Φ) $, respectively. Let $ m_α(Φ,λ) $ be the multiplicity of $ λ$ as an eigenvalue of $ A_α(Φ) :=αD(Φ)+(1-α)A(Φ)$,
Samanta, Aniruddha, Kannan, M. Rajesh
openaire   +1 more source

Relation between the inertia indices of a complex unit gain graph and those of its underlying graph

Linear and Multilinear Algebra, 2020
A T -gain graph is a triple Φ = ( G , T , ϕ ) consisting of an underlying graph G = ( V ( G ) , E ( G ) ) , the circle group T = { z ∈ C : | z | = 1 } and a gain function ϕ : E → → T , such that ϕ ...
Shahid Zaman, Xiaocong He
openaire   +1 more source

Bounds of nullity for complex unit gain graphs

Linear Algebra and its Applications
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chen, Qian-Qian, Guo, Ji-Ming
openaire   +1 more source

On the relation between the adjacency rank of a complex unit gain graph and the matching number of its underlying graph

Linear and Multilinear Algebra, 2020
Let G ϕ be an n-vertex complex unit gain graph and let G be its underlying graph. The adjacency rank of G ϕ , written as r ( G ϕ ) , is the rank of its adjacency matrix and denote by α ′ ( G ) the ...
Shuchao Li, Ting Yang
openaire   +1 more source

Bounds for the rank of a complex unit gain graph in terms of the independence number

Linear and Multilinear Algebra, 2022
Rongxia Hao, Aimei Yu, Shengjie He
exaly  

On the relation between the adjacency rank of a complex unit gain graph and the matching number of its underlying graph

Linear and Multilinear Algebra, 2022
Shuchao Li
exaly