On the edge chromatic vertex stability number of graphs

Abstract: For an arbitrary invariant

h o (G)

of a graph

G

, the

h o -

vertex stability number

v s_{h o} (G)

is the minimum number of vertices of

G

whose removal results in a graph

H s u b s e t e q G

with

h o (H) e q h o (G)

or with

E (H) = v a r n o t h i n g

. In this paper, first we give some general lower and upper bounds for the

h o

-vertex stability number, and then study the edge chromatic stability number of graphs,

v s_{c h i^{p r i m e}} (G)

, where

c h i^{p r i m e} = c h i^{p r i m e} (G)

is edge chromatic number (chromatic index) of

G

. We prove some general results for this parameter and determine

v s_{c h i^{p r i m e}} (G)

for specific classes of graphs.

Recommendations

Cites work

Cited in

(8)

This page was built for publication: On the edge chromatic vertex stability number of graphs