Downloads: 113 | Views: 267
Research Paper | Mathematics | India | Volume 6 Issue 5, May 2017 | Popularity: 6.6 / 10
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
Edition: Volume 6 Issue 5, May 2017
Pages: 2255 - 2258
Please Disable the Pop-Up Blocker of Web Browser
Verification Code will appear in 2 Seconds ... Wait