Results 181 to 190 of about 29,130 (196)
Some of the next articles are maybe not open access.
The gap between the rank of a complex unit gain graph and its underlying graph
Discrete Applied MathematicszbMATH Open Web Interface contents unavailable due to conflicting licenses.
Qiannan Zhou
exaly +2 more sources
Discret. Math., 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shuchao Li, Wei Wei
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shuchao Li, Wei Wei
openaire +3 more sources
Bounds for the rank of a complex unit gain graph in terms of its maximum degree
Linear Algebra and its Applications, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lu, Yong, Wu, Jingwen
openaire +2 more sources
On the multiplicity of $Aα$-eigenvalues and the rank of complex unit gain graphs
2021Let $ Φ=(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, 2020A 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
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
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
Discrete Applied Mathematics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Qi Wu, Jialei Song, Yong Lu
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Qi Wu, Jialei Song, Yong Lu
openaire +2 more sources
Gain distance matrices for complex unit gain graphs
Discrete Mathematics, 2022Rajesh Kannan M, Aniruddha Samanta
exaly
The effect on Aα-eigenvalues of mixed graphs and unit gain graphs by adding edges in clusters
Linear and Multilinear Algebra, 2022Yuantian Yu, Shuchao Li
exaly

