On the edge chromatic vertex stability number of graphs
AbstractFor an arbitrary invariant [Formula: see text] of a graph G, the [Formula: see text]vertex stability number [Formula: see text] is the minimum number of vertices of G whose removal results in a graph [Formula: see text] with [Formula: see text] or with [Formula: see text] In this paper, firs...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2023-01-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | https://www.tandfonline.com/doi/10.1080/09728600.2022.2149367 |
| Summary: | AbstractFor an arbitrary invariant [Formula: see text] of a graph G, the [Formula: see text]vertex stability number [Formula: see text] is the minimum number of vertices of G whose removal results in a graph [Formula: see text] with [Formula: see text] or with [Formula: see text] In this paper, first we give some general lower and upper bounds for the ρ-vertex stability number, and then study the edge chromatic vertex stability number of graphs, [Formula: see text] where [Formula: see text] is edge chromatic number (chromatic index) of G. We prove some general results for this parameter and determine [Formula: see text] for specific classes of graphs. |
|---|---|
| ISSN: | 0972-8600 2543-3474 |