ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

A Study on Achromatic Coloring Graphs and its Applications

Journal: International Journal of Science and Research (IJSR) (Vol.2, No. 1)

Publication Date:

Authors : ; ;

Page : 105-108

Keywords : Achromatic coloring; achromatic number; Lower bound; Upper bound;

Source : Downloadexternal Find it from : Google Scholarexternal


The achromatic number a (G) of a graph is the greatest number of color in a vertex coloring such that each pair of colors appears on at least one edge. In this paper we give some properties of achromatic coloring for complete graphs and its applications.

Last modified: 2021-06-30 20:10:51