Chromatic Number of Graphs with Special Distance Sets-V - Open Journal of Discrete Mathematics

OJDM > Vol.3 No.1, January 2013

Open Journal of Discrete Mathematics

Volume 3, Issue 1 (January 2013)

ISSN Print: 2161-7635 ISSN Online: 2161-7643

Google-based Impact Factor: 0.64 Citations

Chromatic Number of Graphs with Special Distance Sets-V ()

HTML XML

Download as PDF (Size: 213KB) PP. 1-6

DOI: 10.4236/ojdm.2013.31001 3,832 Downloads 7,290 Views Citations

Author(s)

Venkataraman Yegnanarayanan, Angamuthu Parthiban

Affiliation(s)

Department of Mathematics, Velammal Engineering College, Chennai, India.

ABSTRACT

An integer distance graph is a graph G(Z,D) with the set of integers as vertex set and an edge joining two vertices u and v if and only if ∣u - v∣

D where D is a subset of the positive integers. It is known that x(G(Z,D) )=4 where P is a set of Prime numbers. So we can allocate the subsets D of P to four classes, accordingly as is 1 or 2 or 3 or 4. In this paper we have considered the open problem of characterizing class three and class four sets when the distance set D is not only a subset of primes P but also a special class of primes like Additive primes, Deletable primes, Wedderburn-Etherington Number primes, Euclid-Mullin sequence primes, Motzkin primes, Catalan primes, Schroder primes, Non-generous primes, Pell primes, Primeval primes, Primes of Binary Quadratic Form, Smarandache-Wellin primes, and Highly Cototient number primes. We also have indicated the membership of a number of special classes of prime numbers in class 2 category.

KEYWORDS

Primes; Chromatic Number; Distance Graphs

Share and Cite:

V. Yegnanarayanan and A. Parthiban, "Chromatic Number of Graphs with Special Distance Sets-V," Open Journal of Discrete Mathematics, Vol. 3 No. 1, 2013, pp. 1-6. doi: 10.4236/ojdm.2013.31001.

Cited by

[1]	Prime Distance Graphs and Applications of Graph Labeling: A Modelling Approach
	… Research and Computer Science Vol. 10, 2022

[2]	Some Results on Prime and Distinct Prime Distance Labeling of Graphs
	2019

[3]	SOME DEGREE BASED TOPOLOGICAL INDICES OF GENERALIZED TRANSFORMATION GRAPHS AND OF THEIR COMPLEMENTS
	2016

[4]	THE FORCING EDGE-TO-VERTEX GEODETIC NUMBER OF A GRAPH
	International Journal of Pure and Applied Mathematics, 2015

[5]	Application of Euclid distance-based fuzzy similarity priority ratio method to quantitative decision-makings concerning seed introduction of lawn grass
	2014

[6]	VERTEX COLORING OF CERTAIN DISTANCE GRAPHS
	2013

[7]	Chromatic Number of Graphs with Special Distance Sets-V
	2013

Journals Menu

Follow SCIRP

	+1 323-425-8868
	customer@scirp.org
	+86 18163351462(WhatsApp)
	1655362766

	Paper Publishing WeChat

Journals Menu

Home

About SCIRP

Service

Policies