The rank of a complex unit gain graph in terms of the matching number

preprint2020arXivOpen access

Abstract

A complex unit gain graph (or T{\mathbb T}-gain graph) is a triple Φ=(G,T,φ)Φ=(G, {\mathbb T}, φ) (or (G,φ)(G, φ) for short) consisting of a simple graph GG, as the underlying graph of (G,φ)(G, φ), the set of unit complex numbers T={z∈C:∣z∣=1}\mathbb{T}= \{ z \in C:|z|=1 \} and a gain function φ:E→→Tφ: \overrightarrow{E} \rightarrow \mathbb{T} with the property that φ(ei,j)=φ(ej,i)−1φ(e_{i,j})=φ(e_{j,i})^{-1}. In this paper, we prove that 2m(G)−2c(G)≤r(G,φ)≤2m(G)+c(G)2m(G)-2c(G) \leq r(G, φ) \leq 2m(G)+c(G), where r(G,φ)r(G, φ), m(G)m(G) and c(G)c(G) are the rank of the Hermitian adjacency matrix H(G,φ)H(G, φ), the matching number and the cyclomatic number of GG, respectively. Furthermore, the complex unit gain graphs (G,T,φ)(G, \mathbb{T}, φ) with r(G,φ)=2m(G)−2c(G)r(G, φ)=2m(G)-2c(G) and r(G,φ)=2m(G)+c(G)r(G, φ)=2m(G)+c(G) are characterized. These results generalize the corresponding known results about undirected graphs, mixed graphs and signed graphs. Moreover, we show that 2m(G−V0)≤r(G,φ)≤2m(G)+b(G)2m(G-V_{0}) \leq r(G, φ) \leq 2m(G)+b(G) holds for any subset V0V_0 of V(G)V(G) such that G−V0G-V_0 is acyclic and b(G)b(G) is the minimum integer ∣S∣|S| such that G−SG-S is bipartite for S⊂V(G)S \subset V(G).

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.