
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
Numerical Analysis, Algebra and Number Theory, 05C50 (Primary) 05C22, 05C25 (Secondary), Adjacency eigenvalues, Incidence matrix, Signless Laplacian, FOS: Mathematics, Discrete Mathematics and Combinatorics, Mathematics - Combinatorics, Gain graph, Laplacian eigenvalues, Geometry and Topology, Combinatorics (math.CO), Laplacian matrix
Numerical Analysis, Algebra and Number Theory, 05C50 (Primary) 05C22, 05C25 (Secondary), Adjacency eigenvalues, Incidence matrix, Signless Laplacian, FOS: Mathematics, Discrete Mathematics and Combinatorics, Mathematics - Combinatorics, Gain graph, Laplacian eigenvalues, Geometry and Topology, Combinatorics (math.CO), Laplacian matrix
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 79 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 1% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
