IJPAM: Volume 92, No. 1 (2014)
COMPLETE BIPARTITE GRAPHS
Department of Mathematics
Faculty of Science
Khon Kaen University
Centre of Excellence in Mathematics
PERDO, Bangkok, 10400, THAILAND
Abstract. A graph has an equitable -defective coloring in colors if its vertices can be colored with colors such that the maximum degree of any subgraph induced by vertices assigned to the same color is at most and the numbers of vertices in any two sets composed of the vertices that are assigned to the same color differ by at most one. The equitable -defective chromatic number of a graph denoted by is the smallest positive integer for which has an equitable -defective coloring in colors. In this paper, we present the equitable -defective chromatic numbers of complete bipartite graphs for and
Received: December 11, 2013
AMS Subject Classification: 05C15, 05C35
Key Words and Phrases: equitable defective coloring, complete bipartite graph
Download paper from here.
DOI: 10.12732/ijpam.v92i1.6 How to cite this paper?
Source: International Journal of Pure and Applied Mathematics
ISSN printed version: 1311-8080
ISSN on-line version: 1314-3395
Pages: 73 - 86
This work is licensed under the Creative Commons Attribution International License (CC BY).