Integrated Intelligent Research (IIR) International Journal of Computing Algorithm

Volume: 03, Issue: 01 June 2014, Pages: 44-47

ISSN: 2278-2397

b-Chromatic Number of Subdivision Edge and

Vertex Corona
T.Pathinathan1, A.Arokia Mary2, D.Bhuvaneswari2
Department of Mathematics,Loyola college,Chennai
1
2
Department of Mathematics, St.Joseph’sCollege, Cuddalore, India
Email:arokia68@gmail.com,bhuvi64@gmail.com

Abstract - In this paper, we find that the b-chromatic number

on corona graph of subdivision-vertex path with path. Then
corona graph of any graph with path, cycle and complete graph
and cycle with path.

Keywords: b-chromatic number, corona graph, subdivision-

edge corona, subdivision-vertex corona, edge corona.

I. INTRODUCTION

G1 ∘ G2
The b-chromatic number of a graph G , denoted by
 b (G) , is
the maximal integer k such that G may have a b-coloring with
k colors. This parameter has been defined by Irving and
DEFINITION2.2. Let
G1 and
G2 be two graphs on disjoint
Manlove. The subdivision graph S (G ) of a graph G is the n1 and n2 m1 m2
sets of vertices, and edges respectively. The
graph obtained by inserting a new vertex into every edge of G ,
edge corona
G1 ⋄ G2 of G1 and G2 is defined as the graph
we denote the set of such new vertices by I (G ) .
obtained by taking one copy of
G1 and
m1 copies of
G2 and
In two new graph operations based on subdivision graphs,
then joining two end-vertices of the i edge of
th G1 to every
subdivision-vertex join and subdivision-edge join. The corona
of two graphs was first introduced by R.Frucht and F.Harary in th G2 .
[11]. And another variant of the corona operation, the vertex in the i copy of
neighbourhood corona, was introduced in [12].
Example: Let
G1 be the cycle of order 4 and
G2 be the
II. PRELIMINARIES
complete graph
k2 of order 2. The two edge coronas
G 1 ⋄ G 2.

DEFINITION2.1.Let
G1 and G2 be two graphs. Let
V(G1 )  v1 , v2 ,..., vk  G2 .
and take k copies of The
G1  G2 is Vi to G2 G1
corona the graph obtained by joining each
th
every vertex of the i copy of
G2 , 1  i  k .

G2 G1

1
Integrated Intelligent Research (IIR) International Journal of Computing Algorithm
Volume: 03, Issue: 01 June 2014, Pages: 44-47
ISSN: 2278-2397

 For 1 ≤i ≤n , assign the color c i to u2 i , ∀ i≠ 2.

G1 ⋄ G2  For 1 ≤i ≤n , assign the color c i to u3 i , ∀ i≠ 3.
 For 1 ≤i ≤n , assign the color c i to u¿ , ∀ i≠ n .
III. SUBDIVISION-VERTEX AND SUBDIVISION-  For 1 ≤i ≤n , assign to vertex uii one of allowed colors.
EDGE CORONA
Define χ b ( P3 ⊙ P 2) =5.
DEFINITION 3.1. The Subdivision-vertex Corona of two
 For 1 ≤i ≤5 , assign the color c i to vi .
G1 G2 , denoted byG1 ⊙ G2 is the
vertex-disjoint graphs and  For 1 ≤l ≤5 , assign the color c i to u1 i ∀ i ≠1.

graph obtained from

S (G1 ) and V(G1 ) copies of
G2 , all
 For 1 ≤l ≤5 , assign the color c i to u2 i ∀ i ≠2.
 For 1 ≤l ≤5 , assign the color c i to u3 i ∀ i ≠3.
vertex-disjoint by joining the i vertex of
th V(G1 ) to every
1 2
th G
vertex in the i copy of 2 .

DEFINITION3.2.The Subdivision-edge Corona of two vertex

1 2 4 5
disjoint graphs
G1 and
G2 denoted by
G1 ⊝ G2 is the graph

obtained from
S (G1 ) and
I(G1 )
copies of
G2 , all vertex- 3

disjoint, by joining the i

th
vertex of
I(G1 ) to every vertex in
th
the i copy of
G2 . 2 3
1 2
χ b ( P3 ⊙P 2) =5
Let
G1 is a graph on
n1 vertices and
m1 edges and
G2 is a
n2 m2 IV.VERTEX CORONA
graph on vertices and edges then the subdivision-

vertex Corona G 1 ⊙G 2 has

n1 (1  n2 )  m1 vertices and
4.1 GRAPHS WITH PATH

2m1  n1 (n2  m2 ) THEOREM4.1.1 Let Gbe a simple graph on n vertices. Then

edges, and the Subdivision-edge Corona
G1 ⊝ G 2 has m1 (1  n2 )  n1 vertices and m1 (2  n2  m2 ) b (G Pn )   n 1, for n 3
n for n  3

edges. PROOF:
V(G)  v1 , v2 ,..., vn  V(Pn )  u1 , u2 ,..., un 
THEOREM 3.3. Let Pn be a path of n vertices and Pm be a Let and . Let
path of m vertices. Then V(G Pn )  vi :1  i  n  U ij :1  i  n;1  j  n
.

{
χ b ( Pn ⊙ Pm )= 2 n−1 n ≥ m .
m+1 n<m By the definition of Corona graph each vertex of G is adjacent

to every vertex of n copy of

Pn . i.e) every vertex vi  V(G )
PROOF.
Let V ( Pn )= { v 1 , v 2 ,… , v n } and V ( Pm ) ={ u1 ,u 2 , … , um } . is adjacent to every vertex from the set
u
ij :1  j  n
.
let
V ( Pn ∘ Pm ) ={ v i ∶1 ≤i ≤ n } ∪ { uij ∶ 1≤ i≤ m ;1 ≤ j ≤ m } . Assign the following n -coloring for G Pn as b-chromatic
By the definition of corona graph, each vertex of Pn is n , assign the color ci to vi .
 For 1  i 
adjacent to every vertex of a copy of Pm .
 For 1  i  n , assign the color ci to u1i , i  1. .
Assign the following n-coloring for P n ⊙ P m as b-chromatic.  For 1  i  n , assign the color ci to u2i , i  2. .
 For 1 ≤i ≤n , assign the color c i to vi . n , assign the color vi to uni , i  n. .
 For 1  i 
 For 1 ≤i ≤n , assign the color c i to u1 i, ∀ i≠ 1.
2
Integrated Intelligent Research (IIR) International Journal of Computing Algorithm
Volume: 03, Issue: 01 June 2014, Pages: 44-47
ISSN: 2278-2397

 For 1  i  n , assign the vertex

uii one of allowed colors-
4.2. GRAPH WITH CYCLE
such color exists because
2  deg(u ii )  3 and n  3 . G be n vertices
THEOREM4.2.1. Let a simple graph on

 b (G  Pn ) n  3 . Then  b (G  Cn )  n .
Let us assume that is greater than n ie)
 b (G Pn )  n  1 n  3 there must be at least n 1 Proof:

G P V(G)  v1 , v2 ,..., vn  V(Cn )  u1 , u2 ,..., un 

vertices of degree n in n all with distinct colors, and Let and . Let
each adjacent to vertices of all of the other colors. But then V(G Cn )  vi :1  i  n  uij :1  i  n;1  j  n
. By the
these must be the vertices
v1 , v2 ,..., vn  . Since these are only definition of Corona graph, each vertex of G is adjacent to
ones with degree at least n . This is a contradiction. b-coloring Cn . i.e., every vertex vi  V(G )
every vertex of a copy of is
n  1 colors is impossible.
with
adjacent to every vertex from the set
u ij :1  j  n
.

Thus we have
b (G Pn )  n . Hence
 b (G Pn )  n , n -coloring for G Cn
Assign the following as b-chromatic:
n  3 . n , assign the color ci vi .
 For 1  i  to
G  P4 ( V(G) )  4  For 1  i  n , assign the color ci to
u1i , i  1.
Define b-coloring of with 5 colors in the
following way:  For 1  i  n , assign the color ci u2i , i  2.
to

For 1  i  n , assign the color ci to uni , i  n.

 For 1  i  5 , assign the color
ci to
vi . 

c u1l , l  1.  For 1  i  n , assign to vertex uii one of allowed

 For 1  l  5 , assign the color l to
deg(u ii )  3 and n  3
 For 1  l  5 , assign the color
cl to
u2l , l  2. colors-such color exists, because .

 For 1  l  5 , assign the color

cl u3l , l  3.
to  b (G Cn )  n . Assume that  b (G  C n ) is greater than n ,
 For 1  l  5 , assign the color
cl to u4l , l  4.  b (G C n )  n  1 n  3 , there must be at least n  1
ie)
For 1  l  5 , assign the color
cl u5l , l  5.
 to
vertices of degree n in
G C
n , all with distinct colors, and

We have each adjacent to vertices of all of the other colors. But then
b (G  P4 )  5 . Hence  b (G  Pn )  n n  3 . these must be the vertices
v1 , v2 ,..., vn  . Since these are only
ones with degree at least n . This is the contradiction b-
2 3 4 5
coloring with n  1 color is impossible.

1  b (G  Cn )  n . Hence  b (G Cn )  n , n  3 .
We have
5 1
χ b ( G ∘C 3 )=4.
4 2 2 222
3 5 3
3 2
1 4
χ b ( G ∘ P4 )=5

3 2 4 1 4
4 2
5
1 2 3 1
2 3
4 1 χ b ( G ∘C 3 )=4.
5 1 4

3
3
Integrated Intelligent Research (IIR) International Journal of Computing Algorithm
Volume: 03, Issue: 01 June 2014, Pages: 44-47
ISSN: 2278-2397

4.4. GRAPH WITH COMPLETE GRAPH

Theorem4.4.1 :Let G be a simple graph on n vertices. Then
 b G  K n   n  1.
4.3. CYCLE WITH PATH
Cn be a cycle of n vertices and Pn be a Proof.
THEOREM 4.3.1Let
V(G)  v1 , v2 ,..., vn  V(K n )  u1 , u2 ,..., un 
path of n vertices. Then
 b (Cn  Pn )  n Let and .
LetV ( G∘ K n ) ={ v i : 1≤ i ≤ n } ∪ { uij : 1≤ i ≤ n ; 1≤ j ≤ n } . By
Proof: the definition of corona graph, each vertex of G is adjacent to
V(C n )  v1 , v2 ,..., vn  V(Pn )  u1 , u2 ,..., un  every vertex of a copy of
K n . i.e., every vertex vi  V(G ) is
Let and .Le

t
V(Cn  Pn )  vi :1  i  n  uij :1  i  n;1  j  n
, By the adjacent to every vertex from the set
u ij :1  j  n
.
definition of Corona graph, each vertex of G is adjacent to
Assign the following n  1 -coloring for
G K n as b-
every vertex of a copy of
Pn . i.e., every vertex vi  V(Cn ) is chromatic:

adjacent to every vertex from the set

u ij :1  j  n
.
 For 1  i  n , assign the color ci to
vi .

 b (C n  Pn )  n .  For 1  l  n , assign the color cl to

u1l , l  1.
Assign the following b-coloring for
Cn  Pn .  For 1  l  n , assign the color cl to
u2l , l  2.

 For 1  l  n , assign the color cl to

u3l , l  3.

For 1  l  n , assign the color

cl to u4l , l  4.
 For 1  i  n , assign the color ci to
vi . 
……………………………………
 For 1  i  n , assign the color
ci u1i , i  1.
to ……………………………………

 For 1  i  n , assign the color

ci to u2i , i  2. ……………………………………
...………………………………….
…………………………………
………………………………….  For 1  l  n , assign the color cl to
unl , l  n.
………………………………….
 For 1  l n, assign the color
cn 1 and
ull Therefore,
……………………………………
ci uni , i  n.  b G  K n   n  1.
 For 1  i  n , assign the color to

For 1  i  n , assign to vertex

uii
 one of allowed colors
Let us assume that
 b G  K n  is greater than n 1, i.e.,
2  deg(u ii )  3 and n  3
such color exists, because .  b G  K n   n  2 , there must be at least n  2 vertices of
 b (C n  Pn )  n . Hence  b (Cn  Pn )  n . degree n  1 in
G K
n , all with distinct colors, and each
We have
adjacent to vertices of all of the other colors. But then these
We have
 b (C3  P2 )  3 .
must be the vertices
v1 , v2 ,...vn , since these are only ones with
2 3
degree at least n  1 . This is the contradiction, b-coloring with
1 n2 colors is impossible. Thus, we have
 b G  K n   n  1. . Hence,.

1 2 χ b ( C 3 ∘ P 2 )=3.3 1 V. CONCLUSION

3 2

4
Integrated Intelligent Research (IIR) International Journal of Computing Algorithm
Volume: 03, Issue: 01 June 2014, Pages: 44-47
ISSN: 2278-2397

In this existing subdivision-vertex corona graphs, they used

spectrum. Here we study about subdivision- vertex corona
graph using b-chromatic number.

REFERENCE

[1] B.Effantin, The b-chromatic number of power graphs of complete

caterpillars, J. Discrete Math. Sci. Cryptogr. 8(2005), 483-502.
[2] B.Effantin and H.Kheddouci, The b-chromatic number of some power
graphs, Discrete Math. Theor.Comput.Sci. 6 (2003).45-54.
[3] B.Effantin and H.Kheddouci. Exact value for the b-chromatic number of
a power complete k-ary tree, J. Discrete Math. Sci. Cryptogr. 8 (2005),
117-129.
[4] F. Bonomo, G.Duran, F.Maffray, J.Marenco and M.Valencia-pabon, On

the b-colring of cographs and

P 4 -sparse graphs, Graphs and
Combinatorics, 25(2) (2009), 153-167.
[5] R.W. Irving and D.F. Manlove, The b-Chromatic number of a graph,
Discrete Appl.Math. 91 (1999), 127-141.
[6] M. Kouider and A. El Sahili, About b-colouring of regular graphs,
Rapport de Recherche No 1432, CNRS-Universite Paris SudLRI,
02/2006.
[7] Marko Jakovacand SandiKlavzar, The b-Chromatic number of cubic
graphs, Graphs and Combinatorics, 26(1) (2010) 107-118.
[8] Venkatachalam.M and vernoldVivin.J, The b-Chromatic number of star
graph families, Le Mathematiche, 65(1) (2010), 119-125.
[9] D. M. Cvetkovic, M. Doob, H. Simic, An Introduction to the Theory of
Graph Spectra, Cambridge University Press, Cambridge, 2010.
[10] G.Indulal, Spectrum of two new joins of graphs and iinfinte families of
integral graphs, KragujevacJ.Math. 36 (2012) 133-139.
[11] R. Frucht, F.Haray, On the corona of two graphs, Aequationes Math. 4
(1970) 322-325.
[12] I. Gopalapillai, The spectrum of neighborhood corona of graphs,
Kragujevacjournal of Mathematics 35 (2011) 493-500.