Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
5773077 | Linear Algebra and its Applications | 2017 | 19 Pages |
Abstract
A T-gain graph is a triple Φ=(G,T,Ï) consisting of a graph G=(V,E), the circle group T={zâC:|z|=1} and a gain function Ï:EââT such that Ï(eij)=Ï(eji)â1=Ï(eji)â¾. The rank of T-gain graph Φ, denoted by r(Φ), is the rank of the adjacency matrix of Φ. Yu et al. (2015) [8] obtained some properties of inertia of a T-gain graph. They characterized the T-gain unicyclic graphs with small positive or negative index. Motivated by above, in this paper, we characterize the complex unit gain connected bicyclic graphs with rank 2, 3 or 4.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
Authors
Yong Lu, Ligong Wang, Peng Xiao,