Abstract
A complex unit gain graph (or -gain graph) is a triple (or for short) consisting of a simple graph , as the underlying graph of , the set of unit complex numbers and a gain function with the property that . In this paper, we prove that , where , and are the rank of the Hermitian adjacency matrix , the matching number and the cyclomatic number of , respectively. Furthermore, the complex unit gain graphs with and are characterized. These results generalize the corresponding known results about undirected graphs, mixed graphs and signed graphs. Moreover, we show that holds for any subset of such that is acyclic and is the minimum integer such that is bipartite for .
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.