Downloads: 113 | Views: 120
Research Paper | Mathematics | India | Volume 6 Issue 5, May 2017
Chromatic Edge Stability Number of a Graph
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
Edition: Volume 6 Issue 5, May 2017,
Pages: 2255 - 2258
Similar Articles with Keyword 'chromatic number'
Research Paper, Mathematics, India, Volume 9 Issue 2, February 2020Pages: 687 - 690
Chromatic Number and Weak Complement of L-Fuzzy Graphs
Sreedevi V.S. | Dr. Bloomy Joseph 
Downloads: 1 | Weekly Hits: ⮙1 | Monthly Hits: ⮙1
Research Paper, Mathematics, India, Volume 11 Issue 3, March 2022Pages: 942 - 944
A Preliminary Concept on Graph Coloring
Dr P. Srilakshmi  | Dr A. Sri Krishna Chaitanya