Spectral properties of complex unit gain graphs

DOI10.1016/J.LAA.2011.10.021zbMATH Open1241.05085arXiv1110.4554OpenAlexW2093091655MaRDI QIDQ417440FDOQ417440

Authors: Nathan Reff 

Publication date: 14 May 2012

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1110.4554

Recommendations

• On the adjacency matrix of a complex unit gain graph
• Complex unit gain graphs with exactly one positive eigenvalue
• Spectra of quaternion unit gain graphs
• On eigenspaces of some compound complex unit gain graphs
• On the determinant of the Laplacian matrix of a complex unit gain graph

zbMATH Keywords

Laplacian matrixLaplacian eigenvaluessignless Laplacianincidence matrixgain graphadjacency eigenvalues

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Signed and weighted graphs (05C22) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Cites Work

• Title not available (Why is that?)
• Signless Laplacians of finite graphs
• Two sharp upper bounds for the Laplacian eigenvalues.
• Bounds for the least Laplacian eigenvalue of a signed graph
• Matrices in the theory of signed simple graphs
• An introduction to the theory of graph spectra
• On the Laplacian Eigenvalues of Signed Graphs
• Biased graphs. I: Bias, balance, and gains
• Spektren endlicher Grafen
• Biased graphs IV: Geometrical realizations
• On products and line graphs of signed graphs, their eigenvalues and energy
• A characterization on graphs which achieve the upper bound for the largest Laplacian eigenvalue of graphs.
• Bounds on the index of the signless Laplacian of a graph
• On the Laplacian eigenvalues of a graph
• On the Exceptional Case in a Characterization of the Arcs of a Complete Graph
• An upper bound on the Laplacian spectral radius of the signed graphs
• Title not available (Why is that?)

Cited In (73)

• Synchronization of linear oscillators coupled through a dynamic network with interior nodes
• Oriented hypergraphic matrix-tree type theorems and bidirected minors via Boolean order ideals
• The rank of a complex unit gain graph in terms of the matching number
• Laplacian matrices of weighted digraphs represented as quantum states
• A reciprocal eigenvalue property for unicyclic weighted directed graphs with weights from \(\{\pm 1,{\pm}i\}\)
• Bounds for the rank of a complex unit gain graph in terms of its maximum degree
• Gain distance matrices for complex unit gain graphs
• Some upper bounds for the net Laplacian index of a signed graph
• Bounds for the energy of a complex unit gain graph
• Relation between the inertia indices of a complex unit gain graph and those of its underlying graph
• Extremizing first eigenvalue of 3-colored digraphs made with given blocks
• The multiplicity of an \(A_\alpha \)-eigenvalue: a unified approach for mixed graphs and complex unit gain graphs
• Characterizations of line graphs in signed and gain graphs
• Godsil-McKay switching for mixed and gain graphs over the circle group
• Spectra of quaternion unit gain graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Bounding the largest eigenvalue of signed graphs
• Mixed paths and cycles determined by their spectrum
• Complex unit gain graphs of rank 2
• Negative (and positive) circles in signed graphs: a problem collection
• On the spectrum of some signed complete and complete bipartite graphs
• GRAPHS DETERMINED BY THEIR -GAIN SPECTRA
• Complex unit gain bicyclic graphs with rank 2, 3 or 4
• On cospectrality of gain graphs
• The rank of a complex unit gain graph in terms of the rank of its underlying graph
• Balancedness and the least Laplacian eigenvalue of some complex unit gain graphs
• On the Laplacian coefficients of signed graphs
• Lagrangian Duality in Complex Pose Graph Optimization
• A characterization of oriented hypergraphic balance via signed weak walks
• On the determinant of the Laplacian matrix of a complex unit gain graph
• A group representation approach to balance of gain graphs
• Inertia of complex unit gain graphs
• A characterization of oriented hypergraphic Laplacian and adjacency matrix coefficients
• On the relation between the adjacency rank of a complex unit gain graph and the matching number of its underlying graph
• Hermitian matrices of roots of unity and their characteristic polynomials
• Spectral fundamentals and characterizations of signed directed graphs
• Unit gain graphs with two distinct eigenvalues and systems of lines in complex space
• Complex unit gain graphs with exactly one positive eigenvalue
• Gain-line graphs via \(G\)-phases and group representations
• Laplacian matrices of general complex weighted directed graphs
• Combinatorial necessary conditions for regular graphs to induce periodic quantum walks
• Title not available (Why is that?)
• Oriented gain graphs, line graphs and eigenvalues
• The \(k\)-generalized Hermitian adjacency matrices for mixed graphs
• Incidence hypergraphs: the categorical inconsistency of set-systems and a characterization of quiver exponentials
• Hermitian adjacency matrix of the second kind for mixed graphs
• Bounds for the extremal eigenvalues of gain Laplacian matrices
• Universality in perfect state transfer
• On the adjacency matrix of a complex unit gain graph
• Eigenvalues of complex unit gain graphs and gain regularity
• An upper bound for the Laplacian index of a signed graph
• Incidence matrices and line graphs of mixed graphs
• Principal Minors of Hermitian (Quasi-)Laplacian Matrix of Second Kind for Mixed Graphs
• Construction of cospectral graphs, signed graphs and \(\mathbb{T}\)-gain graphs via partial transpose
• Characterizing signed mixed graphs with small eigenvalues
• The spectral property of hypergraph coverings
• On singularity and properties of eigenvectors of complex Laplacian matrix of multidigraphs
• On the spectrum of complex unit gain graphs
• Bounds of nullity for complex unit gain graphs
• A switching method for constructing cospectral gain graphs
• Mixed graphs whose Hermitian adjacency matrices of the second kind have the smallest eigenvalue greater than \(- \frac{3}{2}\)
• Title not available (Why is that?)
• NEPS of complex unit gain graphs
• On connected \(\mathbb{T}\)-gain graphs with rank equal to girth
• On symmetric spectra of Hermitian adjacency matrices for non-bipartite mixed graphs
• Eigenvalues of dual Hermitian matrices with application in formation control
• \( \gamma \)-inverse graph of some mixed graphs
• On bounds of \(A_\alpha\)-eigenvalue multiplicity and the rank of a complex unit gain graph
• Inertia indices of a complex unit gain graph in terms of matching number
• Bounds for the rank of a complex unit gain graph in terms of the independence number
• On the \({A_{\!\mathbb{C}}}\)-rank of multidigraphs
• Title not available (Why is that?)

This page was built for publication: Spectral properties of complex unit gain graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q417440)