TL;DR: In this article, the adjacency, incidence and Laplacian matrices of a complex unit gain graph are studied and eigenvalue bounds for the adjACency matrix are derived.
TL;DR: In this paper, a theory of orientation on gain graphs (voltage graphs) was developed to generalize the notion of orientation for graphs and signed graphs, and the line graph of a gain graph was studied.
TL;DR: A complex unit gain graph as discussed by the authors is a simple graph in which each orientation of an edge is given a complex number with modulus 1 and its inverse is assigned to the opposite orientation of the edge.
Abstract: A complex unit gain graph is a simple graph in which each orientation of an edge is given a complex number with modulus 1 and its inverse is assigned to the opposite orientation of the edge. In thi...
TL;DR: Some properties of inertia of T -gain graph are investigated, including numbers of the positive, negative and zero eigenvalues of A(?) including multiplicities, respectively.
TL;DR: This paper provides a combinatorial description of det ( L ( G ) ) that generalizes that for the determinant of the Laplacian matrix of a signed graph.