Author(s):
1. Arnfried Kemnitz:
Computational Mathematics, Technical University Braunschweig,Universita ̈tsplatz 2, 38 106 Braunschweig,Germany
2. Massimiliano Marangio:
Computational Mathematics, Technical University Braunschweig,Universita ̈tsplatz 2, 38 106 Braunschweig,Germany
Abstract:
For an arbitrary invariant (G) of a graph G the -edge stability number es (G) of G is the minimum number of edges of G whose removal results in a graph H G with (H) 6= (G). If such an edge set does not exist, then es (G) = 1. Gallai's Theorem states that 0(G) + 0(G) = n(G) for a graph G without isolated vertices, where 0(G) is the matching number, 0(G) the edge covering number, and n(G) the order of G. We prove a corresponding result for invariants that are based on the edge stability number es (G).
Page(s):
118-121
Published:
Journal: Discrete Mathematics Letters, Volume: 12, Issue: 0, Year: 2023
Keywords:
graph invariant
,
edge stability number
,
Gallais Theorem
References:
References are not available for this document.
Citations
Citations are not available for this document.