Spectral properties of complex unit gain graphs
From MaRDI portal
Publication:417440
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 5575533 (Why is no real title available?)
- scientific article; zbMATH DE number 47926 (Why is no real title available?)
- A characterization on graphs which achieve the upper bound for the largest Laplacian eigenvalue of graphs.
- An introduction to the theory of graph spectra
- An upper bound on the Laplacian spectral radius of the signed graphs
- Biased graphs IV: Geometrical realizations
- Biased graphs. I: Bias, balance, and gains
- Bounds for the least Laplacian eigenvalue of a signed graph
- Bounds on the index of the signless Laplacian of a graph
- Matrices in the theory of signed simple graphs
- On products and line graphs of signed graphs, their eigenvalues and energy
- On the Exceptional Case in a Characterization of the Arcs of a Complete Graph
- On the Laplacian Eigenvalues of Signed Graphs
- On the Laplacian eigenvalues of a graph
- Signless Laplacians of finite graphs
- Spektren endlicher Grafen
- Two sharp upper bounds for the Laplacian eigenvalues.
Cited in
(74)- The rank of a complex unit gain graph in terms of the rank of its underlying graph
- Gain distance matrices for complex unit gain graphs
- Relation between the inertia indices of a complex unit gain graph and those of its underlying graph
- On the spectrum of some signed complete and complete bipartite graphs
- Characterizations of line graphs in signed and gain graphs
- The \(k\)-generalized Hermitian adjacency matrices for mixed graphs
- A group representation approach to balance of gain graphs
- Spectra of quaternion unit gain graphs
- Universality in perfect state transfer
- Hermitian adjacency matrix of the second kind for mixed graphs
- Bounds for the extremal eigenvalues of gain Laplacian matrices
- Some upper bounds for the net Laplacian index of a signed graph
- Extremizing first eigenvalue of 3-colored digraphs made with given blocks
- On the relation between the adjacency rank of a complex unit gain graph and the matching number of its underlying graph
- Lagrangian duality in complex pose graph optimization
- On the Laplacian coefficients of signed graphs
- Graphs determined by their \(T\)-gain spectra
- Line graphs of complex unit gain graphs with least eigenvalue \(-2\)
- Complex unit gain graphs of rank 2
- Bounds for the energy of a complex unit gain graph
- Oriented hypergraphic matrix-tree type theorems and bidirected minors via Boolean order ideals
- Oriented gain graphs, line graphs and eigenvalues
- A characterization of oriented hypergraphic balance via signed weak walks
- Bounding the largest eigenvalue of signed graphs
- The rank of a complex unit gain graph in terms of the matching number
- On eigenspaces of some compound complex unit gain graphs
- Mixed paths and cycles determined by their spectrum
- scientific article; zbMATH DE number 7666851 (Why is no real title available?)
- Synchronization of linear oscillators coupled through a dynamic network with interior nodes
- On the determinant of the Laplacian matrix of a complex unit gain graph
- Balancedness and the least Laplacian eigenvalue of some complex unit gain graphs
- The multiplicity of an \(A_\alpha \)-eigenvalue: a unified approach for mixed graphs and complex unit gain graphs
- Complex unit gain bicyclic graphs with rank 2, 3 or 4
- Laplacian matrices of weighted digraphs represented as quantum states
- 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
- Spectral fundamentals and characterizations of signed directed graphs
- Unit gain graphs with two distinct eigenvalues and systems of lines in complex space
- A reciprocal eigenvalue property for unicyclic weighted directed graphs with weights from \(\{\pm 1,{\pm}i\}\)
- Inertia of complex unit gain graphs
- A characterization of oriented hypergraphic Laplacian and adjacency matrix coefficients
- Negative (and positive) circles in signed graphs: a problem collection
- On cospectrality of gain graphs
- On the adjacency matrix of a complex unit gain graph
- Bounds for the rank of a complex unit gain graph in terms of its maximum degree
- Godsil-McKay switching for mixed and gain graphs over the circle group
- Principal Minors of Hermitian (Quasi-)Laplacian Matrix of Second Kind for Mixed Graphs
- Incidence matrices and line graphs of mixed graphs
- Incidence hypergraphs: the categorical inconsistency of set-systems and a characterization of quiver exponentials
- On singularity and properties of eigenvectors of complex Laplacian matrix of multidigraphs
- scientific article; zbMATH DE number 7692350 (Why is no real title available?)
- Construction of cospectral graphs, signed graphs and \(\mathbb{T}\)-gain graphs via partial transpose
- NEPS of complex unit gain graphs
- \( \gamma \)-inverse graph of some mixed graphs
- On connected \(\mathbb{T}\)-gain graphs with rank equal to girth
- On symmetric spectra of Hermitian adjacency matrices for non-bipartite mixed graphs
- The determinant of the Laplacian matrix of a quaternion unit gain graph
- On the spectrum of complex unit gain graphs
- Bounds of nullity for complex unit gain graphs
- Characterizing signed mixed graphs with small eigenvalues
- The spectral property of hypergraph coverings
- Inertia indices of a complex unit gain graph in terms of matching number
- Hermitian matrices of roots of unity and their characteristic polynomials
- An upper bound for the Laplacian index of a signed graph
- Balance theory: an extension to conjugate skew gain graphs
- A switching method for constructing cospectral gain graphs
- Eigenvalues of dual Hermitian matrices with application in formation control
- Mixed graphs whose Hermitian adjacency matrices of the second kind have the smallest eigenvalue greater than \(- \frac{3}{2}\)
- Bounds for the rank of a complex unit gain graph in terms of the independence number
- On bounds of \(A_\alpha\)-eigenvalue multiplicity and the rank of a complex unit gain graph
- Eigenvalues of complex unit gain graphs and gain regularity
- On the \({A_{\!\mathbb{C}}}\)-rank of multidigraphs
- Combinatorial necessary conditions for regular graphs to induce periodic quantum walks
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)
