The gap between the rank of a complex unit gain graph and its underlying graph
From MaRDI portal
Publication:6611040
DOI10.1016/j.dam.2024.07.021zbMATH Open1548.05206MaRDI QIDQ6611040
Kexin Du, Yong Lu, Qiannan Zhou
Publication date: 26 September 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices
- A characterization of graphs \(G\) with nullity \(|V(G)|-2m(G)+2c(G)\)
- On the nullity of a graph with cut-points
- Spektren endlicher Grafen
- On connected graphs of order \(n\) with girth \(g\) and nullity \(n-g\)
- The rank of a graph after vertex addition
- 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
- Relationship between the rank and the matching number of a graph
- Graphs \(G\) with nullity \(2c(G) + p(G) - 1\)
- Graphs with nullity \(2c(G)+p(G)-1\)
- Graphs \(G\) with nullity \(n(G) - g(G) -1\)
- On connected signed graphs with rank equal to girth
- The rank of a signed graph
- Complex unit gain graphs of rank 2
- A short proof of Zhou, Wong and Sun's conjecture
- The rank of a complex unit gain graph in terms of the matching number
- Bounds for the rank of a complex unit gain graph in terms of its maximum degree
- On the nullity of a connected 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\)
- A sharp upper bound of the nullity of a connected graph in terms of order and maximum degree
- 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
- The rank of a complex unit gain graph in terms of the rank of its underlying graph
- Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank
- On the nullity of graphs
- 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
- An improved lower bound for the nullity of a graph in terms of matching number
- Relation between the rank of a signed graph and the rank of its underlying graph
- Skew-rank of an oriented graph in terms of matching number
- The extremal graphs with respect to their nullity
- Proof of a conjecture on the nullity of a graph
This page was built for publication: The gap between the rank of a complex unit gain graph and its underlying graph