A survey of the maximal and the minimal nullity in terms of omega invariant on graphs
From MaRDI portal
(Redirected from Publication:6152840)
Recommendations
- No graph with nullity \(\eta(G) = | V(G) | - 2 m(G) + 2 c(G) - 1\)
- A characterization of graphs \(G\) with nullity \(|V(G)|-2m(G)+2c(G)\)
- Relation between the nullity of a graph and its matching number
- Characterization of graphs with given order, given size and given matching number that minimize nullity
- On the nullity of graphs
Cites work
- A characterization of graphs \(G\) with nullity \(|V(G)|-2m(G)+2c(G)\)
- A characterization of graphs with rank 4
- A characterization of graphs with rank 5
- A remark on the existence of finite graphs
- 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
- Characterization of graphs with given order, given size and given matching number that minimize nullity
- Matching number in relation with maximal-minimal nullity conditions and cyclomatic number by coefficient relations
- Nullities of graphs with given order, matching number and cyclomatic number revisited
- Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices
- Nullity of graphs: an updated survey
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- On the nullity and the matching number of unicyclic graphs
- On the nullity number of graphs
- The extremal graphs with respect to their nullity
This page was built for publication: A survey of the maximal and the minimal nullity in terms of omega invariant on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6152840)