Presented by

Abstract
A graph G(p,q) is said to be a combination graph if G
admits an assignment of distinct integers 1, 2, 3, ..., p to
the vertices such that edge values obtained by the
number of combinations of larger vertex value taken
smaller vertex value at a time are distinct.

Suppose the edges values are k, k+1, k+2, ..., k+q1 then
G is called strong k-combination graph.

In this paper, we obtain combination and strong k-
combination labeling for some cycle and star related
graphs.
1. Introduction

2. Combination Labeling of Graphs

3. Strong 2 and 3-Combination labeling of graphs
The presentation
1. Introduction
All graphs considered here are finite, simple and
undirected.

Hedge, et.al introduces combination and strong
k-combination labeling and proved that the
following graphs have a combination labeling
C
n
(n>3), K
n
if and only if n 2,
K
r,r
if and only if r 2 and W
n
(n7).

Baskar Babujee, et.al prove the following graphs
are combination graphs:
union of stars, m copies of C
3
, C
m
C
n
(m,n3) and
C
n
K
1


Vishnupriya, et.al prove the following graphs are
strong 2-combination graphs:
Y-tree, CT(n,m) and K
1,n,n


Combination Labeling
A(p, q) graph G = (V, E) is said to be a combination graph
if there exists a bijection f : V(G) {1,2,3,,p} such that
the induced edge function g
f
: E(G) N defined as



is injective, where
f(u)
C
f(v)
is the number of
combinations of f(u) things taken f(v) at a time. Such a
labeling f is called Combination Labeling of G.

A graph which admits combination labeling is called a
Combination Graph.

>
>
=
f(u) f(v) if C
f(v) f(u) if C
(uv) g
f(u)
f(v)
f(v)
f(u)
f
Strong K-Combination Graph
A (p,q) graph G = (V,E) is said to be a strong k-
combination graph if there exists a bijection
f: V(G) {1,2,3,p} the induced edge function
g
f
: E(G) {k, k+1, k +2,.,k + q 1} defined by



is bijective for some positive integer k. Such a
labeling f is called strong k-Combination Labeling of G.

A graph which admits strong k-combination labeling is
called a Strong k-Combination Graph.

>
>
=
f(u) f(v) if C
f(v) f(u) if C
(uv) g
f(u)
f(v)
f(v)
f(u)
f
Spider
A tree is called a Spider if it has a center vertex c of
degree k > 1 and each other vertex either is a leaf
(pendent vertex) or has degree 2.

Thus a spider is an amalgamation of k paths with
various lengths.

If it has x
1
paths of length a
1
, x
2
paths of length a
2
, ...,
we denote the spider by SP( )
where a
1
< a
2
< ... < a
m
and x
1
+ x
2
+ ... + x
m
= k.

SP(n
1
) is P
n
, SP(1
n
) is K
1,n
and SP(2
n
) is K
1,n,n
.
m 2 1
x
m
x
2
x
1
a a a ,..., ,
2. Combination Labeling of Graphs
Theorem:
The graph is combination graph.
Proof:
Let G be
G has k(n+2)-1 vertices and k(n+2)-2 edges.
The vertex set
V(G) = {v
11
,v
12
,,v
1n
,v
21
,v
22
,,v
2n
,,v
k1
,v
k2
,,v
kn
,
c
1
, c
2
,,c
k
, x
1
,x
2
,,x
k-1
}

where v
11
,v
12
,,v
kn
are pendant vertices, where i = 1,2,..,k
c
i
be the apex vertex of where i = 1,2,..,k and
x
1
,x
2
,,x
k1
be vertices such that c
i1
and

c
i
are adjacent to x
i1
, where
2 s i s k of G.
> <
(k)
n 1,
(2)
n 1,
(1)
n 1,
K : ... : K : K
> <
(k)
n 1,
(2)
n 1,
(1)
n 1,
K : ... : K : K
(i)
n 1,
K
The edge set E(G) = E
1
E
2

where E
1
= {c
i
v
ij
: 1 s i s k and j = 1,2,n } and
E
2
= {c
i-1
x
i-1
and x
i-1
c
i
: 2 s i s k}


Define f : V(G) {1,2,3,, k(n+2)-1}
f(x
i
) = 2i, for i = 1,2,,k-1
f(c
i
) = 2i1, for i = 1,2,,k
f(v
ij
) = 2k1+(i1)n+j, for i = 1,2,..,k and j = 1,2,,n.


The induced map g
f
: EN, where N is the set of positive
integers is defined as follows, for edge in E
1
,
g
f
(c
i
v
ij
) = for i = 1,2,,k and j =1,2,,n.

The induced labeling for edges in E
1
are
{
2k
C
1
,
2k+1
C
1
,,
2k+n-1
C
1
,
2k+n
C
3
,
2k+n+1
C
3
,,
2k+2n-1
C
3
,,
2k+(k-1)n
C
2k-1
,
2k+(k-1)n+1
C
2k-1
,,
2k+kn-1
C
2k-1
}

Taking any two edges from the set, it is clear that the induced
labeling for edges is increasing order and they are distinct.
1 - 2i
j 1)n - (i 1 - 2k
C
+ +
For edge in E
2
,
g
f
(c
i-1
x
i-1
) =
2i-2
C
2i-3
and g
f
(x
i-1
c
i
) =
2i-1
C
2i-2
for 2 s i s k.

The induced labeling for edges in E
2
are {
2
C
1
,
3
C
2
,,
2k-1
C
2k-2
}
i.e E
2
are {2,3,,2k-1}.

All induced labeling for edges in E
2
are distinct.

Hence induced labeling for edges in is distinct.
Therefore is combination graph.

> <
(k)
n 1,
(2)
n 1,
(1)
n 1,
K : ... : K : K
> <
(k)
n 1,
(2)
n 1,
(1)
n 1,
K : ... : K : K
Illustration
The combination labeling of is shown in
Figure
> <
(3)
1,5
(2)
1,5
(1)
1,5
K : K : K
1
c
2
c
3
c
1
x
2
x
11
v
12
v
13
v
14
v
15
v
21
v
22
v
23
v
24
v
25
v
31
v
32
v
33
v
34
v
35
v
> <
(3)
1,5
(2)
1,5
(1)
1,5
K : K : K
2
4
3
11
12
13
14
10 1
6
7
8 9
10
5
16
17
18 19
20
3 2
4 5
6
7
8
9
10
3
11
C
3
12
C
3
13
C
3
14
C
3
15
C
5
16
C
5
17
C
5
18
C
5
19
C
5
20
C
The combination labeling of
Theorem
SP
n
C
m
is combination graph for all n> 1 and m > 3.

Proof :
Let G = SP
n
C
m
, where SP
n
is a spider of n vertices &
C
m
is a cycle of m vertices.
(G is a disconnected graph with 2 components SP
n
and C
m
)

G has n+m vertices and n+m-1 edges.

The vertices and edges SP
n
are c,v
1
,v
2
,,v
n-1
and e
1
,e
2
,,e
n-1

respectively.

The vertices and edges of C
m
are v
n
,v
n+2
,,v
n+m-1
and
e
n
,e
n+1
,,e
n+m-1
respectively.
Define f : V(G) {1,2,3,,n+m}
f(c) = 1
f(v
i
) = i+1, for i = 1,2,,n+m-1.
The induced map g
f
: E N, is defined as follows,
(for SP
n
) g
f
(e
i
) = f(v
i
) = i+1 for 1 s i s n-1

For SP
n
, each edge e
i
is either cv
i
type or v
i-1
v
i
type where
i = 1 s i s n-1.
Therefore the induced edge labeling are either type
or type

i.e., induced edge labeling of SP
n
are 2,3,,n.

f(c)
) f(v
C
i
) f(v
) f(v
1 - i
i
C
For C
m
, the induced edge labeling
g
f
(e
i
) = = f(v
i+1
) = i+2 for n s i s n+m-2 and
g
f
(e
n+m-1
) = =
n+m
C
n+1
or
n+m
C
m-1
.

i.e., induced edge labeling of C
m
are n+2,n+3,,n+m and
n+m
C
m
or
n+m
C
n
.

The induced edge labeling of G are 2,3,,n, n+2, n+3, ,
n+m and
n+m
C
n+1
or
n+m
C
m-1
.

Hence induced labeling for edges in SP
n
C
m
are
distinct.

Therefore SP
n
C
m
is combination graph.
) f(v
) f(v
i
1 i
C
+
) f(v
) f(v
n
1 - m n
C
+
Illustration
The combination labeling of SP
11
C
5
is shown in figure
c
11
v
12
v
13
v
14
v
15
v
1
v
3
v
4
v
2
v
5
v
6
v
7
v
8
v
9
v
10
v
1
2
4
5
3
6
7
8
9
10
11
12
13
14 5 1
16
3
6
2
4
5
7
8
9
10
11
13
14
15
16
12
16
C
Flower Pot Cracker Graph
Flower Pot Cracker Graph is obtained from cycle of m
vertices and spider of n vertices, by joining the center
vertex of spider and any one vertex of the cycle.

It is denoted by FPC(C
m
,SP( ))
where a
1
< a
2
< ... < a
m
, x
1
+x
2
+...+x
m
= k and
a
1
x
1
+a
2
x
2
+...+a
m
x
m
=n-1.

For our convenience, we write FPC(C
m
,SP( ))
as FPC(C
m
,SP
n
) or FPC
m,n

m 2 1
x
m
x
2
x
1
a a a ,..., ,
m 2 1
x
m
x
2
x
1
a a a ,..., ,
Theorem
FPC
m
,
n
is combination graph for all m > 3 and n > 1.
Proof :
Let G be FPC
m
,
n
m > 3 and n > 1. G has n+m-1 vertices
and n+m-1 edges.

The vertices and edges G are c,v
1
,v
2
,,v
n-1
, v
n
, v
n+1
, ,
v
n+m-2
and e
1
,e
2
,,e
n-1
, e
n
, e
n+1
,, e
n+m-1
respectively.

The edge set E(G) = E
1
E
2
where E
1
= {e
i
: 1 s i s n-1} and
E
2
= { e
i
: n s i s n+m-1 }
Define f : V(G) {1,2,3,,n+m-1}
f(c) = 1 & f(v
i
) = i+1, for i = 1,2,,n+m-4
f(v
n+m-3
) = n+m-1
f(v
n+m-2
) = n+m-2

The induced map g
f
: E N is defined as follows, for E
1
,
g
f
(e
i
) = f(v
i
) = i+1 for 1s i s n-1.
For E
1
, each edge e
i
is either cv
i
type or v
i-1
v
i
type
where i = 1 s i s n-1.

Therefore the induced edge labeling are either type
or type.
i.e., induced edge labeling of E
1
are 2,3,,n.

f(c)
) f(v
C
i
) f(v
) f(v
1 - i
i
C
For E
2
,

each edge e
i
is either cv
i
type or v
i-1
v
i
type where n
s i s n+m-1.
Therefore the induced edge labeling
g
f
(e
n
) = = f(v
n
) = n+1,

g
f
(e
i
) = = f(v
i
) = i+1 for n+1 s i s n+m-4,

g
f
(e
n+m-2
) = = f(v
n+m-3
) = n+m-1,

g
f
(e
n+m-1
) = = f(v
n+m-2
) = n+m-2,

g
f
(e
n+m-3
) = =
n+m-1
C
n+m-3
=
n+m-1
C
2


f(c)
) f(v
C
n
) f(v
) f(v
1 - i
i
C
) f(v
) f(v
2 - m n
3 - m n
C
+
+
f(c)
) f(v
C
2 - m n+
) f(v
) f(v
4 - m n
3 - m n
C
+
+
Therefore, induced edge labeling of E
2
are
n+1, n+2, n+3,, n+m-3, n+m-2, n+m-1 and
n+m-1
C
2
.

The induced edge labeling of G are 2, 3 ,, n, n+1, n+2,
n+3 ,, n+m-3, n+m-2, n+m-1 and
n+m-1
C
2
.

Hence induced labeling for edges in FPC
m
,
n
are distinct.

Therefore FPC
m
,
n
is combination graph.

Illustration
The combination labeling of FPC
5,10
is shown in figure.
Here m = 5, n = 10.
c 1
v
3
v
4
v
2
v
5
v
6
v
7
v
8
v
9
v
10
v
11
v
12
v
13
v
1
2
4
5
3
6
7
8
9
10
12
13
14
11
3
6
2
4
5
7
8
9
10
11
2
14
C
12
14
13
3. Strong 2 & 3-combination labeling of graphs
Theorem: SP
n
is strong 2-combination graph for all n > 1.
Proof :
Let G be a spider of n vertices and n-1 edges.
It has k paths of various lengths.

x
1
paths of length a
1
, x
2
paths of length a
2
, ..,
x
m
paths of length a
m
where a
1
<a
2
<...<a
m
, x
1
+x
2
+...+x
m
= k and
a
1
x
1
+a
2
x
2
+...+a
m
x
m
=n-1.

The vertices and edges of G are c, v
1
,v
2
,,v
n-1
and
e
1
,e
2
,,e
n-1
respectively.
Define f : V(G) {1,2,3,,n}
f(c) = 1
f(v
i
) = i+1, for i = 1,2,,n-1

The induced map g
f
: E N, is defined as follows,
(each edge e
i
of G is either cv
i
type or v
i-1
v
i
type where 1 s i s n)
type or type.

i.e g
f
(e
i
)= f(v
i
) = i+1 for 1 s i s n-1.

Hence induced labeling for edges in spider are distinct.
Clearly for each edge we have 2,3,,k+q-1.

Therefore SP
n
is strong 2-combination graph.
f(c)
) f(v
C
i
) f(v
) f(v
1 - i
i
C

NOTE
For various a
i
s and x
i
s, we have different types of spider
graph with n vertices.

But the above labeling method depends only on the
number of vertices, but not a
i
s and x
i
s.

For our convenience, we write SP( ) as SP
n
,
where a
1
<a
2
<...<a
m
, x
1
+x
2
+...+x
m
= k and
a
1
x
1
+a
2
x
2
+...+a
m
x
m
= n-1

SP
n
denotes the spider graph of n vertices.
m 2 1
x
m
x
2
x
1
a a a ,..., ,
Illustration
The strong 2-combination labeling of SP
16
is shown in figure
1
2
4
5
3
6
7
8
9
10
11
15
16
14
13
12
3
6
2
4
5
7
8
9
10
11
16
15
14
13
12
Theorem
SP
n
P
m
is strong 3-combination graph for all n, m > 1.

Proof :
Let G = SP
n
P
m
, where SP
n
is a spider of n vertices and
P
m
is a path of m vertices.

G has n+m vertices and n+m-2 edges.
The vertices and edges of P
m
are v
1
,v
2
,,v
m
and
e
1
,e
2
,,e
m-1
respectively.

The vertices and edges SP
n
are c,v
m+1
,v
m+2
,,v
m+n-1
and
e
m
,e
m+2
,,e
m+n-2
respectively.

Define f : V(G) {1,2,3,,n+m}
f(c) = 1
f(v
i
) = i+1, for i = 1,2,,n+m-1.
The induced map g
f
: E N is defined as follows
(here G is a disconnected graph with 2 components SP
n
and P
m
)
For SP
n
,
each edge e
i
is either cv
i+1
type or v
i
v
i+1
type where i = m s i s m+n-2
The induced edge labeling are either
type or type.

g
f
(e
i
) = f(v
i+1
) = i+2 for m s i s m+n-2.

i.e., induced edge labeling of SP
n
are m+2, m+3,, m+n.
f(c)
) f(v
C
1 i +
) f(v
) f(v
i
1 i
C
+
For P
m
, the induced edge labeling
g
f
(e
i
) = = f(v
i+1
) = i+2 for 1 s i s m-1.

i.e., induced edge labeling of P
m
are 3, 4,,m+1.

The induced edge labeling of G are 3,4,,m+1,m+2, m+3,
, m+n.
Hence induced labeling for edges in SP
n
P
m
are distinct.
Clearly for each edge we have 3,4,,k+q-1.

Therefore SP
n
P
m
is strong 3-combination graph.
) f(v
) f(v
1
1 i
C
+
Illustration
The strong 3-combination labeling of SP
10
P
6
is
shown in figure
c
1
v
3
v
4
v
2
v
5
v
6
v
7
v
8
v
9
v
10
v
14
v
15
v
13
v
12
v
11
v
1
2
4
5
3
6
7
8
9
10
11
15
16
14
13
12
3
6
4
5
7
8
9
10
11
16
15
14
13
12