On the edge chromatic vertex stability number of graphs

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...

Full description

Bibliographic Details
Main Authors: Saeid Alikhani, Mohammad R. Piri
Format: Article
Language:English
Published: Taylor & Francis Group 2023-01-01
Series:AKCE International Journal of Graphs and Combinatorics
Subjects:
Edge chromatic vertex stability number
chromatic index
corona
join
05C15
05C25
Online Access:https://www.tandfonline.com/doi/10.1080/09728600.2022.2149367

Similar Items

Similar Items