The forcing star edge chromatic number of a graph
Abstract
Let S be a χ’st-set of G. A subset T⊆S is called a forcing subset for S if S is the unique χ’st-set containing T. The forcing star-edge chromatic number χ’st(S) of S in G is the minimum cardinality of a forcing subset for S. The forcing star-edge chromatic number χ’st(G) of G is the smallest forcing number of all χ’st-sets of G. Some general properties satisfied by this concept are studied. It is shown that for every pair a and b of integers with 0≤a<b and b>a+2 there exists a connected graph G such that χ’st(G)=a and χ’st(G)=b, where χ’st(G) is the star edge chromatic number of a graph.
Copyright © 2022 R. Suganya, V. Sujin Flower. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Cite this article
R. Suganya, V. S. Flower, The forcing star edge chromatic number of a graph, J. Math. Comput. Sci. 12 (2022), 51. https://doi.org/10.28919/jmcs/6547
BibTeX
@article{Suganya2022,
author = {Suganya, R. and Flower, V. Sujin},
title = {The forcing star edge chromatic number of a graph},
journal = {J. Math. Comput. Sci.},
volume = {12},
year = {2022},
pages = {51},
doi = {10.28919/jmcs/6547}
}