Journal of Information and Computational Science ISSN: 1548-7741

ACHROMATIC NUMBER OF SOME GRAPHS FORMED FROM

THE TENSOR PRODUCT OF SIMPLE GRAPH

D. Jeyanthi Prassanna1 & M.Ramya2

1Assistant Professor, Department of Mathematics, Rathinam College of Arts & Science,
Coimbatore, Tamil Nadu, India.
2Research Scholar, Department of Mathematics, Rathinam College of Arts & Science,
Coimbatore, Tamil Nadu, India.

Abstract:
Let G=(V,E) be an undirected graph, simple, finite and connected graph. The Achromatic coloring is
vertex coloring of a graph in such a way that every pair of distinct colors appears on the endpoints of
atleast one edge. The maximum possible number of the complete coloring of the graph is Achromatic
number Xa(G). In this paper Achromatic number introduced for some graphs which formed from tensor
product of two simple graphs.
Key words: Achromatic coloring & Achromatic number, star coloring & star chromatic number,
Tensor product, middle graph, central graph, Tadpole graph, fan graph, path, cycle and complete
graph.

1. Introduction:
Graph Coloring:
Graph Coloring is one type of a Graph Labeling or you can say it is a sub branch of Graph Labeling
i.e. it is a special case of it. In graph coloring we assign the labels to the elements of a graph based on
some constraints or conditions. The label is actually color. In graph labeling usually we give the integer
number to an edge, or vertex, or to both i.e. to an edge and to a vertex of a graph. Similarly, in graph
theory, we use some colors to label the edges or vertices. But there are some restrictions on using colors.
The problem is, if we have n colors, then we have to find a way for coloring vertices such that no two
adjacent vertices have the same color. There exists some other graph coloring problems also, for
example, Edge Coloring and Face coloring.
In edge coloring, not a single vertex is connected to two edges which are having same color. And face
coloring is related to Geographical map coloring. Edge coloring and face coloring problems can be
transmitted to vertex coloring. A way of using colors initiated from coloring to the countries of a map.
Where each surface is literally colored.

Volume 9 Issue 11 - 2019 506 www.joics.org

Journal of Information and Computational Science ISSN: 1548-7741

Achromatic Coloring and Achromatic Number:

It is a proper vertex colouring such that each pair of color classes is adjacent by at least one edge. The
largest possible number of colors in an achromatic coloring is called the achromatic number and is
denoted by χa(G), where G is a finite un directed graph with no loops and multiple edges.
The achromatic number was defined and studied by Harary, Hedetniemi and prins [4]. Yannakakis and
Gavril [5] Proved that determining this value for general graphs is NP – complete. The NP-completeness
of the achromatic number for trees was established by Cairnie and Edwards [4].
Further it is solvable for paths, cycles, complete bipartite graphs. Roichman [6] gives the achromatic
number for Hypercubes.
Tensor product: Tensor product is variously known as cardinal product (see ˇCul´ık, 1958), Kronecker
product (see Weichsel, 1962), direct product (see Bosak, 1991), categorical product (see Miller, 1968)
and graph conjunction (see Bermond, 1978). Capobianco (1970) used the word tensor product for it.
Various operations of this type are elaborated by Harary& Wilcox (1967).
2. Preliminaries:
2.1 Definition: An assignment of colors to the vertices of a graph G so that no two adjacent vertices of
G have the same color is called vertex coloring of a graph G.

Vertex coloring
2.2 Definition: The other well-known and intensely studied type of graph coloring besides vertex
coloring is the edge- coloring. The edge coloring of a graph G=(V, E) is a mapping, which assigns a
color to every edge, satisfying condition that no two edges sharing a common vertex have the same
color.
2.3 Definition: The minimum number of colors required for the vertex coloring of a graph G, is called
the chromatic number of graph G. (or)
Definition of Chromatic Number: If a graph G is k colorable,butnot(k−1)colorable, it is said that G is
k-chromatic. The minimum number of colours needed to colour G is called the chromaticnumber of G
and is denoted by χ(G), χ(G)≤|V|.The lesser amount of colors needed to color a graph is known as its
chromatic number.

Volume 9 Issue 11 - 2019 507 www.joics.org

Journal of Information and Computational Science ISSN: 1548-7741

This is an example of graph coloring whose chromatic number is 3.

2.4 Definition: Consider a graph G with vertices {v1,v2,... vn}and edges{e1, e2,... ,en}. Let ei be the edge
joining the vertices vivi+1 and {C1, C2,... ,Cn} be the given set of colors. According to achromatic
coloring, for every pair of distinct colors, there is at least one edge in the graph whose endpoints are
assigned those colors. We assign colors Ci and Ci+1 to the end vertices vi and vi+1 of the edge ei. The
other vertices are colored in such a way that each pair of distinct colors have been used at the end vertices
of at least one edge and the achromatic number is the maximum number of such colors used.X a(G).
2.5 Definition:(Central graph): The graph obtained by subdividing each edge of the given graph G
exactly once and joining all the non-adjacent vertices of it is the Central graph C(G) of G .

2.6 Definition:(Middle graph): A graph M(G) with vertex set V (G)∪E(G) and edge set {xy : xy∈
E(G)}∪{xy : x ∈ V (G),y ∈ E(G) and x is an end vertex of y} is the middle graph of G.
2.7 Definition:(Tadpole graph) The Tadpole graph (Tm,n)consists of a cycle Cm and a path Pn, which is
joined by an edge.[1]

2.8 Definition:The Tensor Product G ⊗H of graphs G and H is the graph with point set V(G) x V(H)
where (u1,v1) adj (u2,v2) if, and only if, u1adj u2 and v1adj v2. We obtain a characterization of graphs of
the form G⊗H where G or H is K2.[3]. The tensor product of two graphs G1 and G2 is demonstrated
in figure

Fig. Showing a graph G=P3⊗C3

Volume 9 Issue 11 - 2019 508 www.joics.org

Journal of Information and Computational Science ISSN: 1548-7741

Theorem 1: For the Central graph of Tadpole graph, the Achromatic Number is given by

Xa(C((Tm,n ))) = ∀ m ≥ 3 , n ∈ N,

Proof:
Consider a Tadpole graph with (m+n) vertices and (m+n) edges. Let V(Cm) = {x1, x2,...xm} and V(Pn) =
{y1, y2...yn}, and the connecting edge is x1y1. We subdivide the edges of given graph G exactly once and
join all the non-adjacent vertices of G to get the Central graph C(G). Let the vertices subdivides the
edges x1x2, x2x3,...xmx1 and let subdivides the edges x1y1, y1y2,...yn-1yn, where 1 ≤ i ≤ m, 1 ≤ j ≤ n.
Consider the colors {C1, C2,...Cm+n}.
Case 1: n ≤ 2
Assign the colors C1, C2,...Cn to the vertices yj, 1 ≤ j ≤ n and the colors Cn+i to the vertices xi, 1 ≤ i ≤ m.
Now assign the colors C1, C2,...Cm+n to the vertices and from Definition 2.3 to get all pairs of
distinct colors. The maximum possible colors used is n+m. Therefore Xa(C((Tm,n))) = n+m.
Case 2: n >2
Assign the colors C1, C2,...Cn to the vertices yj, 1 ≤ j ≤ n and the colors Cn+i to the vertices x2,x3,….xm
respectively, where 1 ≤ i ≤ m-1. color vertex x1 and c1 and remaining vertices and with C1,
C2,...Cn+m-1 using the definition 2.3. Therefore Xa(C((Tm,n))) = n+m-1.

Illustration:

Figure 1: Xa(C((T3,2))) = 5.

Figure 2: Xa(C((T4,3))) = 6.

3. Achromatic Number Of Some Graphs Formed From The Tensor Product Of Simple Graphs:
In this section we find out the star chromatic number of various graphs formed from the Tensor product
of simple graphs and Achromatic number of various graphs formed from the Tensor product of simple
graphs

Volume 9 Issue 11 - 2019 509 www.joics.org

Journal of Information and Computational Science ISSN: 1548-7741

Lemma 3.1:
The Tensor Product of graph (G⊗Kn) is L(G) [7], where, Kn:n≥3 is a complete of order n.

Proof:
Let G be a path
Consider the path P3
Suppose V(P3)={u1,u2,u3} &
V(Kn)={ v1,v2,v3,……vn}

First we shall show (P3⊗k3), (P3⊗k4), (P3⊗k5), (P3⊗k5) are L(G)

Illustration:

Tensor product of P3 ⊗K3 which having L(G)=3

Theorem 3.2:
If a graph (Pm⊗kn) then Xa(G)=n

Proof:
We can prove this by induction method.

Let G be a tensor product graph (Pm⊗kn)

If n≥3, Assume that n=3
Then we get L(G)=3
We give each color for every L(G)
By Lemma:3.1, We can say that
L(G)=n
3=3

Volume 9 Issue 11 - 2019 510 www.joics.org

Journal of Information and Computational Science ISSN: 1548-7741

Then assume that n=4

Then we get L(G)=4
We give each color for every L(G)
By the Lemma:3.1, We get L(G)=n
4=4
Likewise
For n=n-1, we get L(G)=n-1
we give each color for every L(G)
n-1=n-1
similarly for n
n=n
we get L(G)=n
we give each color for every L(G)
By the Lemma:3.1, We get L(G)=n
n=n

Since a complete graph consist of n vertices, then the Tensor product of graph (P m⊗kn) then (Xa(G)=n)
Hence the proof

Illustration:

Tensor product of P5⊗K3 which having Xa(G)=3

Volume 9 Issue 11 - 2019 511 www.joics.org

Journal of Information and Computational Science ISSN: 1548-7741

Theorem 3.3:
If a graph (Cm⊗kn) then Xa(G)=n

Proof:
We can prove this by Induction method.

Let G be a Tensor Product graph(Pm⊗kn)

If n≥3 ,Assume that n=3

Then we get L(G)=3
We give each color for every L(G)
By Lemma: 3.1, We can say that
L(G)=n
3=3
Then assume that n=4
Then we get L(G)=4
We give each color for every L(G)
By the Lemma: 3.1,We get L(G)=n
4=4
Likewise
For n=n-1
we get L(G) = n-1
we give each color for every L(G)
n-1 = n-1
Similarly for n
n=n
we get L(G) = n
we give each color for every L(G)
By the Lemma:3.1, We get L(G) = n
n=n

Volume 9 Issue 11 - 2019 512 www.joics.org

Journal of Information and Computational Science ISSN: 1548-7741

Since a complete graph consist of n vertices, then the Tensor product of graph (C m⊗kn) then (Xa(G)=n)
Hence the proof

Illustration:

Tensor product of C4⊗K4which having Xa(G)=4

Theorem 3.4:
If a graph (G⊗kn) then Xa(G)=n
Proof:
We can prove this by induction method.

Let G be a tensor product graph(G⊗kn)

If n≥3. Assume that n=3
Then we get L(G)=3
We give ach color for every L(G)
By Lemma:1, We can say that
L(G)=n
3=3
Then assume that n=4

Volume 9 Issue 11 - 2019 513 www.joics.org

Journal of Information and Computational Science ISSN: 1548-7741

Then we get L(G)=4

We give ach color for every L(G)
By the Lemma:3.1, We get L(G)=n
4=4
Likewise
For n=n-1
we get L(G)=n-1
we give each color for every L(G)
n-1=n-1
similarly for n
n=n
we get L(G)=n
we give each color for every L(G)
By the Lemma:3.1, We get L(G)=n
n=n

Since a complete graph consist of n vertices, then the Tensor Product of graph (G⊗kn) then (Xa(G)=n)
Hence the proof

Conclusion:
In this paper, we have shown that the Achromatic number (Xa(G)) of some of the graphs are as follows:

The Achromatic number of (Pm⊗kn) is n.

The Achromatic number of (Cm⊗kn) is n.
The Achromatic number of (G⊗kn) is n.

Volume 9 Issue 11 - 2019 514 www.joics.org

Journal of Information and Computational Science ISSN: 1548-7741

References:
[1] Aparna K M1Henila Correya2 and Manjusha P,”Achromatic Number of Some Graphs”,
International Journal of Pure and Applied Mathematics Volume 118 No. 20 2018, 941-949
[2] J.A.Gallian, Dynamic Survey DS6: Graph Labeling, Electronic J. Combinatorics, (2007), 1-
58.
[3] E. SAMPATHKUMAR, ON TENSOR PRODUCT GRAPHS, J. Austral. Math. Soc. 20 (Series
A) (1975), 268-273.
[4] F.Harary, S. Hedetniemi, and G. Prins, “An interpolation theorem for graphical
Homomorphism “,Portugal,Math, Vol.26, pp453-462,1967.
[5] M.Yanakakis and F.Gavril, “Edge dominating sets in graphs”, SIAM J.Appl.maths. Vol 38,
pp364-372, 1980.
[6] Y.Roichman, ‘On the Achromatic number of Hypercubes’, Journal of Combinatorial Theory,
Series B, Vol.79, PP177-182, 2000.
[7]ARTO SALOMAA, ON COLOR FAMILIES OF GRAPHS, Annales
AcademireScientiarumFennicre Series A. I. Mathematica Volumen 6, 1981, 135-148

Volume 9 Issue 11 - 2019 515 www.joics.org