An Upper Bound of an Achromatic Index of K14 is 43
Journal Title: INTERNATIONAL JOURNAL OF MATHEMATICS TRENDS AND TECHNOLOGY - Year 2014, Vol 10, Issue 1
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.
Authors and Affiliations
Ganesh Vishwas Joshi , S. D. Deo
Keywords
Related Articles
- EP ID EP88746
- DOI -
- Views 131
- Downloads 0
A Stochastic Frontier Model on Investigating Efficiency of Life Insurance Companies in India
The present paper attempts to investigate the efficiency of life insurance companies in India for the year 2011. An insurance company is said to be efficient if it produce maximum profit using minimum level of available...
Stability Analysis of two Competitive Interacting Species with Optimal and Bionomic Harvesting of the Second Species
This paper deals with two species competitive model with optimal harvesting of the second species under bionomic conditions. The model is characterized by a pair of first order non-linear ordinary differential equa...
On the Dynamical Analysis of a New Model for Measles Infection
Epidemiologists and other health workers all over the world have noted that vaccination is an effective means of preventing most childhood diseases. In this study a compartmental mathematical model was formulated with th...
Evaluation of Watermarking Techniques
Now a days the copyright of multimedia and secrete information is very difficult to transfer across the internet multimedia objects must be compressed before transmitting the data. The JPEG compression is one of th...
RW-CONTINUOUS MAPS AND RW-IRRESOLUTE MAPS IN TOPOLOGICAL SPACES
In this paper we introduce and study the concept of regular weakly continuity (briefly rw-continuity) and regular weakly irresolute (briefly rw-irresolute) in topological spaces and discuss some of their properties...