Spectral properties of complex unit gain graphs

By Nathan Reff. 2011

125 citations recorded by the source corpus.

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.

Subfields: Computational Theory and Mathematics, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/b22c6a54ae4081ebe99ca21e5b041a1e08239dfb

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Aniruddha Samanta
2. Ranjit Mehatari
3. M. Rajesh Kannan

In Geometry and Topology

1. Aniruddha Samanta
2. Ranjit Mehatari
3. M. Rajesh Kannan

Citations in the corpus

• On the adjacency matrix of a complex unit gain graph (2018, background): “2 ([8]): Let 1 = (G,φ1) and 2 = (G,φ2) beT-gain graphs.”