Inertia of complex unit gain graphs

作者:

Highlights:

摘要

Let T={z∈C:|z|=1} be a subgroup of the multiplicative group of all nonzero complex numbers C×. A T-gain graph is a triple Φ=(G,T,φ) consisting of a graph G=(V,E), the circle group T and a gain function φ:E→→T such that φ(eij)=φ(eji)−1=φ(eji)¯. The adjacency matrix A(Φ) of the T-gain graph Φ=(G,φ) of order n is an n × n complex matrix (aij), where aij={φ(eij),ifviisadjacenttovj,0,otherwise.Evidently this matrix is Hermitian. The inertia of Φ is defined to be the triple In(Φ)=(i+(Φ),i−(Φ),i0(Φ)), where i+(Φ),i−(Φ),i0(Φ) are numbers of the positive, negative and zero eigenvalues of A(Φ) including multiplicities, respectively. In this paper we investigate some properties of inertia of T-gain graph.

论文关键词:Inertia,Complex unit gain graph,Tree,Unicyclic graph

论文评审过程:Received 29 March 2015, Revised 18 May 2015, Accepted 24 May 2015, Available online 12 June 2015, Version of Record 12 June 2015.

论文官网地址:https://doi.org/10.1016/j.amc.2015.05.105