A survey of the maximal and the minimal nullity in terms of omega invariant on graphs
Let G = (V, E) be a simple graph with n vertices and m edges. ν(G) and c(G) = m − n + θ be the matching number and cyclomatic number of G, where θ 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 η(G)...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sciendo
2023-12-01
|
| Series: | Acta Universitatis Sapientiae: Mathematica |
| Subjects: | |
| Online Access: | https://doi.org/10.2478/ausm-2023-0019 |