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: | Oz Mert Sinan, Cangul Ismail Naci |
---|---|
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 |
Similar Items
-
Third-party protection through the relative nullity in bankrupt merchant contracts
by: Mostafa Elsan, et al.
Published: (2023-07-01) -
Nullity and Bounds to the Nullity of Dendrimer Graphs
by: Khidir Sharaf, et al.
Published: (2013-12-01) -
Existence of Regular Nut Graphs for Degree at Most 11
by: Fowler Patrick W., et al.
Published: (2020-05-01) -
Navigating Legal Challenges: Implementing Nullity Verdict in Indonesia
by: Senja Pramudia
Published: (2023-11-01) -
THE LEGAL NATURE OF THE CONTRAVENTION AND ITS INFLUENCE ON THE NULLITY OF THE RECORD OF FINDING THE CONTRAVENTION
by: Raluca Antoanetta Tomescu
Published: (2022-03-01)