On the ρ-Edge Stability Number of Graphs

Abstract

For an arbitrary invariant ρ(G) of a graph G the ρ-edge stability number esρ(G) is the minimum number of edges of G whose removal results in a graph H ⊆ G with ρ(H) ≠ ρ(G) or with E(H) = ∅.

Keywords

• edge stability number
• line stability
• invariant
• chromatic edge stability index
• chromatic index
• edge coloring
• 05c15