Spectral properties of complex unit gain graphs
From MaRDI portal
Publication:417440
DOI10.1016/j.laa.2011.10.021zbMath1241.05085arXiv1110.4554MaRDI QIDQ417440
Publication date: 14 May 2012
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1110.4554
incidence matrix; Laplacian eigenvalues; Laplacian matrix; signless Laplacian; gain graph; adjacency eigenvalues
05C25: Graphs and abstract algebra (groups, rings, fields, etc.)
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
05C22: Signed and weighted graphs
Related Items
Unnamed Item, Unnamed Item, Relation between the inertia indices of a complex unit gain graph and those of its underlying graph, Bounds for the rank of a complex unit gain graph in terms of the independence number, On the relation between the adjacency rank of a complex unit gain graph and the matching number of its underlying graph, On the adjacency matrix of a complex unit gain graph, On the spectrum of some signed complete and complete bipartite graphs, Unnamed Item, GRAPHS DETERMINED BY THEIR -GAIN SPECTRA, An upper bound for the Laplacian index of a signed graph, Principal Minors of Hermitian (Quasi-)Laplacian Matrix of Second Kind for Mixed Graphs, Unnamed Item, On singularity and properties of eigenvectors of complex Laplacian matrix of multidigraphs, Mixed graphs whose Hermitian adjacency matrices of the second kind have the smallest eigenvalue greater than \(- \frac{3}{2}\), 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, Incidence hypergraphs: the categorical inconsistency of set-systems and a characterization of quiver exponentials, Hermitian matrices of roots of unity and their characteristic polynomials, Combinatorial necessary conditions for regular graphs to induce periodic quantum walks, Incidence matrices and line graphs of mixed graphs, Extremizing first eigenvalue of 3-colored digraphs made with given blocks, Laplacian matrices of general complex weighted directed graphs, Oriented gain graphs, line graphs and eigenvalues, A characterization of oriented hypergraphic balance via signed weak walks, Negative (and positive) circles in signed graphs: a problem collection, Inertia of complex unit gain graphs, A characterization of oriented hypergraphic Laplacian and adjacency matrix coefficients, Bounds for the extremal eigenvalues of gain Laplacian matrices, A group representation approach to balance of gain graphs, Spectral fundamentals and characterizations of signed directed graphs, The \(k\)-generalized Hermitian adjacency matrices for mixed graphs, Hermitian adjacency matrix of the second kind for mixed graphs, Some upper bounds for the net Laplacian index of a signed graph, Characterizations of line graphs in signed and gain graphs, Unit gain graphs with two distinct eigenvalues and systems of lines in complex space, On cospectrality of gain graphs, Complex unit gain graphs of rank 2, The rank of a complex unit gain graph in terms of the matching number, Synchronization of linear oscillators coupled through a dynamic network with interior nodes, The multiplicity of an \(A_\alpha \)-eigenvalue: a unified approach for mixed graphs and complex unit gain graphs, Complex unit gain graphs with exactly one positive eigenvalue, Bounds for the rank of a complex unit gain graph in terms of its maximum degree, Bounds for the energy of a complex unit gain graph, Gain-line graphs via \(G\)-phases and group representations, Godsil-McKay switching for mixed and gain graphs over the circle group, Gain distance matrices for complex unit gain graphs, Spectra of quaternion unit gain graphs, Mixed paths and cycles determined by their spectrum, Balancedness and the least Laplacian eigenvalue of some complex unit gain graphs, Oriented hypergraphic matrix-tree type theorems and bidirected minors via Boolean order ideals, On the Laplacian coefficients of signed graphs, Complex unit gain bicyclic graphs with rank 2, 3 or 4, Universality in perfect state transfer, On the determinant of the Laplacian matrix of a complex unit gain graph, Laplacian matrices of weighted digraphs represented as quantum states, Bounding the largest eigenvalue of signed graphs, The rank of a complex unit gain graph in terms of the rank of its underlying graph, A reciprocal eigenvalue property for unicyclic weighted directed graphs with weights from \(\{\pm 1,{\pm}i\}\), Lagrangian Duality in Complex Pose Graph Optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On products and line graphs of signed graphs, their eigenvalues and energy
- Biased graphs. I: Bias, balance, and gains
- Spektren endlicher Grafen
- Signless Laplacians of finite graphs
- Bounds on the index of the signless Laplacian of a graph
- On the Laplacian eigenvalues of a graph
- A characterization on graphs which achieve the upper bound for the largest Laplacian eigenvalue of graphs.
- Two sharp upper bounds for the Laplacian eigenvalues.
- Biased graphs IV: Geometrical realizations
- Bounds for the least Laplacian eigenvalue of a signed graph
- Matrices in the Theory of Signed Simple Graphs
- 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
- On the Laplacian Eigenvalues of Signed Graphs
