Bounds for the rank of a complex unit gain graph in terms of its maximum degree
From MaRDI portal
Publication:2228099
DOI10.1016/j.laa.2020.09.035zbMath1458.05149OpenAlexW3090368609MaRDI QIDQ2228099
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
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex degrees (05C07)
Related Items (6)
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 ⋮ On connected \(\mathbb{T}\)-gain graphs with rank equal to girth ⋮ Unnamed Item ⋮ The \(k\)-generalized Hermitian adjacency matrices for mixed graphs ⋮ Hermitian adjacency matrix of the second kind for mixed graphs
Cites Work
- Characterization of graphs with given order, given size and given matching number that minimize nullity
- Bicyclic oriented graphs with skew-rank 2 or 4
- Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices
- Spectral properties of complex unit gain graphs
- A characterization of graphs \(G\) with nullity \(|V(G)|-2m(G)+2c(G)\)
- Bicyclic oriented graphs with skew-rank 6
- Spektren endlicher Grafen
- An upper bound of the nullity of a graph in terms of order and maximum degree
- Inertia of complex unit gain graphs
- The rank of a signed graph in terms of the rank of its underlying graph
- Further results on the nullity of signed graphs
- A note on the nullity of unicyclic signed graphs
- Relationship between the rank and the matching number of a graph
- The rank of a complex unit gain graph in terms of the matching number
- No graph with nullity \(\eta(G) = | V(G) | - 2 m(G) + 2 c(G) - 1\)
- Adjacency rank and independence number of a signed graph
- The leaf-free graphs with nullity \(2 c ( G ) - 1\)
- Complex unit gain bicyclic graphs with rank 2, 3 or 4
- On the determinant of the Laplacian matrix of a complex unit gain graph
- Bounds for the matching number and cyclomatic number of a signed graph in terms of rank
- Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank
- An upper bound for the nullity of a bipartite graph in terms of its maximum degree
- Skew-rank of an oriented graph with edge-disjoint cycles
- Signed graphs with small positive index of inertia
- On the Laplacian Eigenvalues of Signed Graphs
- The skew-rank of oriented graphs
- An improved lower bound for the nullity of a graph in terms of matching number
- More on the minimum skew-rank of graphs
- The nullity of bicyclic signed graphs
- 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
- The extremal graphs with respect to their nullity
This page was built for publication: Bounds for the rank of a complex unit gain graph in terms of its maximum degree
