Downloads: 113 | Views: 239
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
Make Sure to Disable the Pop-Up Blocker of Web Browser
Similar Articles
Downloads: 132 | Weekly Hits: ⮙1 | Monthly Hits: ⮙1
Research Paper, Mathematics, India, Volume 9 Issue 2, February 2020
Pages: 687 - 690Chromatic Number and Weak Complement of L-Fuzzy Graphs
Sreedevi V.S., Dr. Bloomy Joseph
Downloads: 4 | Weekly Hits: ⮙1 | Monthly Hits: ⮙1
Research Paper, Mathematics, India, Volume 11 Issue 3, March 2022
Pages: 227 - 231On Conjugate Graphs of Dihedral Group
Chinmayee Kumar, Kuntala Patra
Downloads: 4 | Weekly Hits: ⮙1 | Monthly Hits: ⮙2
Research Paper, Mathematics, India, Volume 11 Issue 3, March 2022
Pages: 942 - 944A Preliminary Concept on Graph Coloring
Dr P. Srilakshmi, Dr A. Sri Krishna Chaitanya
Downloads: 4 | Weekly Hits: ⮙1 | Monthly Hits: ⮙1
Research Paper, Mathematics, India, Volume 11 Issue 5, May 2022
Pages: 1965 - 1969Conjugate Graph and Some Properties of the SL(2,3) Group
Yangertola, Kuntala Patra
Downloads: 99
Research Paper, Mathematics, India, Volume 4 Issue 3, March 2015
Pages: 672 - 674Dominating-x-Color Number of Harary Graph
T. Ramachandran, A. Naseer Ahmed