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 145
- Downloads 0
RELATIONAL ALGEBRA IN SQL
Relational Algebra is that branch of algebra which deals about set operations on a given relation such as UNION,INTERSECTION,DIFFERENCE,CARTESIAN PRODUCT, PROJECTION ,SELECTION. In this paper we shall discuss these...
(sp)* Closed Sets in Topological Spaces
In this paper we introduce a new class of sets namely, (sp)*-closed sets and properties of this set are investigated. We introduce (sp)*-continuous maps and (sp)*-irresolute maps.
Rough Sets on Topological Spaces
Rough Set Theory propsed by Zdzilaw Pawlak as a mathematical tool for approaching imprecise knowledge and it has many applications in Datamining, Machine Learning,Morphology, Control Theory and Medicine etc., The basic c...
Student Perceptions of Online Homework in Preparatory Year Pre-Calculus courses
The Internet is gradually becoming part and parcel of our lives. As a result, online educational technologies are gaining more acceptance in our educational system. This is more so in higher education. However, online as...
Feature Selection and Extraction for Content-Based Image Retrieval
Content-Based Image Retrieval is a technique that utilizes the visual content of an image to search for similar images in large scale image databases. The visual content of an image represents the low-level feature...