English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

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$ asthe underlying graph of $(G, \varphi)$, $\mathbb{T}= \{ z \in C:|z|=1 \} $ is asubgroup of the multiplicative group of all nonzero complex numbers$\mathbb{C}^{\times}$ and a gain function $\varphi: \overrightarrow{E}\rightarrow \mathbb{T}$ such that$\varphi(e_{ij})=\varphi(e_{ji})^{-1}=\overline{\varphi(e_{ji})}$. In thispaper, we investigate the relation among the rank, the independence number andthe cyclomatic number of a complex unit gain graph $(G, \varphi)$ with order$n$, and prove that $2n-2c(G) \leq r(G, \varphi)+2\alpha(G) \leq 2n$. Where$r(G, \varphi)$, $\alpha(G)$ and $c(G)$ are the rank of the Hermitian adjacencymatrix $A(G, \varphi)$, the independence number and the cyclomatic number of$G$, respectively. Furthermore, the properties of the complex unit gain graphthat reaching the lower bound are characterized.

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