Authors:
PRIYANKA S,DOI NO:
https://doi.org/10.26782/jmcms.spl.2019.08.00075Keywords:
Euclidean space,Choice number,Integer distance graph,Abstract
We have various properties of the finite integer distance graph and arithmetical sequences as distance set are presented. Here analogous the edge coloring and total coloring of integer distance graph and upper bound of choice number established. Integer distance graph relative to the choice number and total choice number, choice index and total choice index discussed and various connectivity questions are also investigated. It is well known that with every nonempty ordinary graph G there is associated a graph L(G), called the line graph of G such that the edge chromatic of G is equal to the vertex chromatic number of L(G). We find it convenient to associate with every ordinary graph G called the totalRefference:
I. J.J. Chen, G.J. Chang, K.C. Huang, Integral distance graphs, J. Graph
Theory 25 (1997) 287-294.
II. M.Voigt, H. Walther, On the chromatic number of special distance
graphs, Discrete Math. 97 (1991) 395-397.
III. M.Voigt, On the chromatic number of distance graphs, J.Inform.
Process.Cybernet. EIK 28 (1992) 21-28.
IV. M.Voigt, H. Walther, On the chromatic number of special distance graphs,
Discrete Math. 97 (1991) 395-397.
V M.Voigt. Farbung von Distanzgraphen, Preprint, 1993.
VI R.B.Eggleton, P.Erdos, D.K.Skilton, Coloring the real line, J.Combin.
Theory B39(1985)86-100.
VII R.B.Eggleton, P.Erdos, D.K.Skilton, Coloring the real line, J.Combin.
Theory Ser.B39 (1985)86-100[Erratum:41(1986)139].
VIII R.B.Eggleton ,P.Erdos, D.K.Skilton, Update information to research
problem 77, Discretemath.69(1988)105.
IX R.B.Eggleton, P.Erdos, D.K.Skilton, Coloring prime distance
graphs,Graphs combinatorics 6(1990)17-32.
X W.A.Deuber,X.Zhu,The chromatic number of the distance graphs,
preprint,1995.