Bounds of nullity for complex unit gain graphs

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Characterization of graphs with given order, given size and given matching number that minimize nullity
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)\)
On the nullity of tricyclic graphs
On the nullity of a graph with cut-points
Spektren endlicher Grafen
On the nullity and the matching number of unicyclic graphs
On the nullity of bicyclic graphs
Inertia of complex unit gain graphs
Nullity and singularity of a graph in which every block is a cycle
The nullity of a graph with fractional matching number
The rank of a signed graph
Complex unit gain graphs of rank 2
The rank of a complex unit gain graph in terms of the matching number
Nonsingular (vertex-weighted) block graphs
No graph with nullity \(\eta(G) = | V(G) | - 2 m(G) + 2 c(G) - 1\)
Complex unit gain bicyclic graphs with rank 2, 3 or 4
Nullities of graphs with given order, matching number and cyclomatic number revisited
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 relation between theH-rank of a mixed graph and the matching number of its underlying graph
On the relation between the adjacency rank of a complex unit gain graph and the matching number of its underlying graph
On the nullity of bipartite graphs
On the nullity of bipartite graphs
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 of nullity for complex unit gain graphs