Share Your Research, Maximize Your Social Impacts
A Study on Achromatic Coloring Graphs and its Applications
Journal: International Journal of Science and Research (IJSR) (Vol.2, No. 1)Publication Date: 2013-01-05
Authors : V.Kavitha; R.Govindarajan;
Page : 105-108
Keywords : Achromatic coloring; achromatic number; Lower bound; Upper bound;
Source : Download
Find it from : Google Scholar
Abstract
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.
Other Latest Articles
- Implementation of Route Optimization Mobile IP to Analyze the TCP Performance during Handoff
- Security and Privacy Issues in High Level MANET Protocol
- Distributed Data Mining and Multi Agent-Based Distributed Data Clustering
- Offline Handwritten Character Recognition Techniques using Neural Network: A Review
- The Impact of Cultural Factors on the Growth of Small and Medium Enterprises in Hyderabad, Sindh
Last modified: 2021-06-30 20:10:51