Bounds for the rank of a complex unit gain graph in terms of its maximum degree

DOI10.1016/J.LAA.2020.09.035zbMATH Open1458.05149OpenAlexW3090368609MaRDI QIDQ2228099FDOQ2228099

Authors: Yanyan Li 

Publication date: 16 February 2021

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.09.035

Recommendations

• Bounds for the rank of a complex unit gain graph in terms of the independence number
• The rank of a complex unit gain graph in terms of the rank of its underlying graph
• The rank of a complex unit gain graph in terms of the matching number
• On bounds of \(A_\alpha\)-eigenvalue multiplicity and the rank of a complex unit gain graph
• Complex unit gain graphs of rank 2

zbMATH Keywords

maximum degreerank of graphscomplex unit gain graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35) Vertex degrees (05C07)

Cites Work

• On the Laplacian Eigenvalues of Signed Graphs
• Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank
• Characterization of graphs with given order, given size and given matching number that minimize nullity
• A characterization of graphs \(G\) with nullity \(|V(G)|-2m(G)+2c(G)\)
• Spektren endlicher Grafen
• Spectral properties of complex unit gain graphs
• Bicyclic oriented graphs with skew-rank 2 or 4
• The skew-rank of oriented graphs
• Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices
• More on the minimum skew-rank of graphs
• 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
• An upper bound of the nullity of a graph in terms of order and maximum degree
• No graph with nullity \(\eta(G) = | V(G) | - 2 m(G) + 2 c(G) - 1\)
• The leaf-free graphs with nullity \(2 c ( G ) - 1\)
• The extremal graphs with respect to their nullity
• An improved lower bound for the nullity of a graph in terms of matching number
• Relationship between the rank and the matching number of a graph
• The rank of a signed graph in terms of the rank of its underlying graph
• An upper bound for the nullity of a bipartite graph in terms of its maximum degree
• Inertia of complex unit gain graphs
• Further results on the nullity of signed graphs
• A note on the nullity of unicyclic signed graphs
• Skew-rank of an oriented graph with edge-disjoint cycles
• Signed graphs with small positive index of inertia
• The nullity of bicyclic signed graphs
• Complex unit gain bicyclic graphs with rank 2, 3 or 4
• Bounds for the matching number and cyclomatic number of a signed graph in terms of rank
• On the determinant of the Laplacian matrix of a complex unit gain graph
• The rank of a complex unit gain graph in terms of the matching number
• Adjacency rank and independence number of a signed graph

Cited In (8)

• Complex unit gain graphs of rank 2
• The gap between the rank of a complex unit gain graph and its underlying graph
• Title not available (Why is that?)
• On connected \(\mathbb{T}\)-gain graphs with rank equal to girth
• 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
• The \(k\)-generalized Hermitian adjacency matrices for mixed graphs
• Hermitian adjacency matrix of the second kind for mixed graphs

This page was built for publication: Bounds for the rank of a complex unit gain graph in terms of its maximum degree

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