Oz, Mert SinanCangul, Ismail Naci2026-02-122026-02-1220231844-60942066-7752https://doi.org/10.2478/ausm-2023-0019https://hdl.handle.net/20.500.12885/7093Let G = (V, E) be a simple graph with n vertices and m edges. nu(G) and c(G) = m - n + theta be the matching number and cyclomatic number of G, where theta is the number of connected components of G, respectively. Wang and Wong in [18] provided formulae for the upper and the lower bounds of the nullity eta(G) of G as eta(G) = n - 2 nu(G) + 2c(G) and eta(G) = n - 2 nu(G) - c(G), respectively. In this paper, we restate the upper and the lower bounds of nullity eta(G) of G utilizing omega invariant and inherently vertex degrees of G. Also, in the case of the maximal and the minimal nullity conditions are satisfied for G, we present both two main inequalities and many inequalities in terms of Omega invariant, analogously cyclomatic number, number of connected components and vertex degrees of G.eninfo:eu-repo/semantics/openAccessnullitymaximal nullity conditionminimal nullity conditionomega invariantmatching numberArticle10.2478/ausm-2023-0019152337353WOS:0011358737000042-s2.0-85181715987Q3Q2