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

Cited by: 0|Bibtex|Views1|Links

Abstract:

A complex unit gain graph (or $\mathbb{T}$-gain graph) is a triple $\Phi=(G, \mathbb{T}, \varphi)$ ($(G, \varphi)$ for short) consisting of a graph $G$ as the underlying graph of $(G, \varphi)$, $\mathbb{T}= \{ z \in C:|z|=1 \} $ is a subgroup of the multiplicative group of all nonzero complex numbers $\mathbb{C}^{\times}$ and a gain fu...More

Code:

Data:

Your rating :
0

 

Tags
Comments