Spectral Properties of Complex Unit Gain Graphs

Abstract

A complex unit gain graph is a graph where each orientation of an edge is given a complex unit, which is the inverse of the complex unit assigned to the opposite orientation. We extend some fundamental concepts from spectral graph theory to complex unit gain graphs. We define the adjacency, incidence and Laplacian matrices, and study each of them. The main results of the paper are eigenvalue bounds for the adjacency and Laplacian matrices.

13 pages, 1 figure, to appear in Linear Algebra Appl

References in corpus (1)

• Matrices in the Theory of Signed Simple Graphs

Cited by in corpus (19)

• Spectral Properties of Oriented Hypergraphs
• A Characterization of Oriented Hypergraphic Laplacian and Adjacency Matrix Coefficients
• Quantum-like states on complex synchronized networks
• A group representation approach to balance of gain graphs
• Complex Laplacians and Applications in Multi-Agent Systems
• On cospectrality of gain graphs
• Gain-line graphs via $G$-phases and group representations
• Oriented Hypergraphic Matrix-tree Type Theorems and Bidirected Minors via Boolean Order Ideals
• Characterizations of line graphs in signed and gain graphs
• On the spectrum of complex unit gain graph
• The spectral property of hypergraph coverings
• Combinatorial necessary conditions for regular graphs to induce periodic quantum walks
• Mixed graphs with cut vertices having exactly two positive eigenvalues
• On Adjacency Matrices and Descriptors of Signed Cycle Graphs
• Bounds for the rank of a complex unit gain graph in terms of the independence number
• Hermitian adjacency matrices with at most three distinct eigenvalues
• Universality in perfect state transfer
• The rank of a complex unit gain graph in terms of the matching number
• Complex unit gain bicyclic graphs with rank 2, 3 or 4