Title of article
On equitable near proper coloring of graphs
Author/Authors
Jose ، Sabitha Department of Mathematics - CHRIST (Deemed to be University) , Samuel ، Libin Chacko Department of Mathematics - CHRIST (Deemed to be University) , Naduvath ، Sudev Department of Mathematics - CHRIST (Deemed to be University)
From page
131
To page
143
Abstract
A defective vertex coloring of a graph is a coloring in which some adjacent vertices may have the same color. An edge whose adjacent vertices have the same color is called a bad edge. A defective coloring of a graph $G$ with minimum possible number of bad edges in $G$ is known as a near proper coloring of G. In this paper, we introduce the notion of equitable near proper coloring of graphs and determine the minimum number of bad edges obtained from an equitable near proper coloring of some graph classes.
Keywords
Improper coloring , equitable coloring , near proper coloring , equitable near proper coloring
Journal title
Communications in Combinatorics and Optimization
Journal title
Communications in Combinatorics and Optimization
Record number
2777638
Link To Document