Chromatic Edge Stability Number of a Graph
Journal: International Journal of Science and Research (IJSR) (Vol.6, No. 5)Publication Date: 2017-05-05
Authors : A. Muthukamatchi;
Page : 2255-2258
Keywords : chromatic number; chromatic bondage number; Chromatic edge stability number;
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.
Other Latest Articles
- A Study to Assess the Efficiency of Discharge Process in Inpatient, Cause of Discharge Delays, and their Impact on Increase Average Length of Stay
- Comparative Studies of DC-DC Boost Convertor and SEPIC Convertor for Global Maximum Power Point Tracking Technique in a PV Array under Partial Shaded Condition
- Reduction in Inorganic Loading Rate in Dairy Wastewater through Use of Nanomaterials: Zinc Oxide and Mixture of P25 Degussa&Zinc Oxide
- Iron Removal from Water by using Cashew Nut Shell
- Vermicompost Preparation from Plant Debris, by Using Eisenia foetida (Red Earthworm) in PSIT campus, Kanpur (U.P.), India
Last modified: 2021-06-30 18:55:25