Chromatic Edge Stability Number of a Graph

A. Muthukamatchi

Abstract: Let G be a graph with chromatic number (G) = k. The chromatic edge stability number es (G) is the minimum number of edges whose removal results in a graph G1 with (G1) = (G) 1. The chromatic bondage number (G) is the minimum number of edges between two color classes in a k coloring of G, where the minimum is taken over all k-colorings of G. We present several interesting results and unsolved problems on Chromatic edge stability number and Chromatic bondage number.

Keywords: chromatic number, chromatic bondage number, Chromatic edge stability number

How to Cite?: A. Muthukamatchi, "Chromatic Edge Stability Number of a Graph", Volume 6 Issue 5, May 2017, International Journal of Science and Research (IJSR), Pages: 2255-2258, https://www.ijsr.net/getabstract.php?paperid=ART20173869, DOI: https://dx.doi.org/10.21275/ART20173869