An Upper Bound of an Achromatic Index of K14 is 43

Ganesh Vishwas Joshi; S.D.Deo

doi:https://doi.org/10.14445/22315373/IJMTT-V10P502

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 10 | Number 1 | Year 2014 | Article Id. IJMTT-V10P502 | DOI : https://doi.org/10.14445/22315373/IJMTT-V10P502

An Upper Bound of an Achromatic Index of K14 is 43

Ganesh Vishwas Joshi , S.D.Deo

Abstract

Achromatic Indices A(Kn) of complete graphs on n vertices are not known in general. It is known that A(K14) ≤ 44.In this paper we have tightened the upper bound of A(K14) to 43.

Keywords

Achromatic index, colouring of graphs, complete edge colouring, proper edge colouring.

References

[1] R.E. Jamison, on the edge of achromatic numbers of graphs, Discrete Mathematics (1989), 99-115

Citation :

Ganesh Vishwas Joshi , S.D.Deo, "An Upper Bound of an Achromatic Index of K14 is 43," International Journal of Mathematics Trends and Technology (IJMTT), vol. 10, no. 1, pp. 12-13, 2014. Crossref, https://doi.org/10.14445/22315373/IJMTT-V10P502