Complex unit gain graphs of rank 2

DOI10.1016/J.LAA.2020.03.023zbMATH Open1437.05157OpenAlexW3011277943MaRDI QIDQ2174098FDOQ2174098

Authors: Yanyan Li 

Publication date: 17 April 2020

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

Full work available at URL: https://doi.org/10.1016/j.laa.2020.03.023

Recommendations

• The rank of a complex unit gain graph in terms of the matching number
• The rank of a complex unit gain graph in terms of the rank of its underlying graph
• Complex unit gain bicyclic graphs with rank 2, 3 or 4
• Spectral properties of complex unit gain graphs
• Unit gain graphs with two distinct eigenvalues and systems of lines in complex space
• Gain distance matrices for complex unit gain graphs
• Line graphs of complex unit gain graphs with least eigenvalue \(-2\)
• Bounds for the rank of a complex unit gain graph in terms of its maximum degree
• Inertia of complex unit gain graphs
• On the adjacency matrix of a complex unit gain graph

zbMATH Keywords

complex unit gain graphrank of graphs\(\mathbb{T}\)-gain graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Signed and weighted graphs (05C22)

Cites Work

• Biased graphs. I: Bias, balance, and gains
• A characterization of long graphs of arbitrary rank
• A characterization of graphs with rank 5
• Title not available (Why is that?)
• A characterization of graphs with rank 4
• On the nullity and the matching number of unicyclic graphs
• Spectral properties of complex unit gain graphs
• Bicyclic oriented graphs with skew-rank 2 or 4
• The skew-rank of oriented graphs
• Bicyclic graphs with small positive index of inertia
• On the nullity of graphs
• Hermitian adjacency spectrum and switching equivalence of mixed graphs
• Mixed graphs with \(H\)-rank 3
• A characterization of signed planar graphs with rank at most 4
• The inertia of weighted unicyclic graphs
• Balance in gain graphs - a spectral analysis
• Bicyclic oriented graphs with skew-rank 6
• Skew-rank of an oriented graph in terms of matching number
• Relation between the skew-rank of an oriented graph and the rank of its underlying graph
• On the relationship between the skew-rank of an oriented graph and the rank of its underlying graph
• The rank of a signed graph in terms of the rank of its underlying graph
• Inertia of complex unit gain graphs
• Signed graphs with cut points whose positive inertia indexes are two
• Complex unit gain bicyclic graphs with rank 2, 3 or 4
• The rank of a complex unit gain graph in terms of the rank of its underlying graph
• On the determinant of the Laplacian matrix of a complex unit gain graph

Cited In (28)

• The rank of a complex unit gain graph in terms of the matching number
• Eigenvalues of complex unit gain graphs and gain regularity
• Bounds for the rank of a complex unit gain graph in terms of its maximum degree
• Gain distance matrices for complex unit gain graphs
• Extremal values of the Sombor index in unicyclic and bicyclic graphs
• 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
• Spectra of quaternion unit gain graphs
• The gap between the rank of a complex unit gain graph and its underlying graph
• Complex unit gain bicyclic graphs with rank 2, 3 or 4
• The rank of a complex unit gain graph in terms of the rank of its underlying graph
• On -gain graphs with few positive eigenvalues
• On the spectrum of complex unit gain graphs
• Bounds of nullity for complex unit gain graphs
• Extremal unicyclic graphs with respect to vertex-degree-based topological indices
• Inertia of complex unit gain graphs
• Title not available (Why is that?)
• NEPS of complex unit gain graphs
• On connected \(\mathbb{T}\)-gain graphs with rank equal to girth
• Unit gain graphs with two distinct eigenvalues and systems of lines in complex space
• Complex unit gain graphs with exactly one positive eigenvalue
• Inertia indices of a complex unit gain graph in terms of matching number
• Combinatorial necessary conditions for regular graphs to induce periodic quantum walks
• Bounds for the rank of a complex unit gain graph in terms of the independence number
• The \(k\)-generalized Hermitian adjacency matrices for mixed graphs
• On the \({A_{\!\mathbb{C}}}\)-rank of multidigraphs
• Relations between the positive inertia index of a \(\mathbb{T}\)-gain graph and that of its underlying graph
• On the adjacency matrix of a complex unit gain graph

This page was built for publication: Complex unit gain graphs of rank 2

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