VERTEX POLYNOMIALOF OPEN STAR OF GRAPHS

 (G )
Abstract The vertex polynomial of the graph G = (V, E) is defined as V (G, x)   vk x k ,
k 0

where (G )  max{ deg( v) / v  V } and vk is the number of vertices of degree k. In this paper I
seek to find the vertex polynomial of open star of some graphs such as lotus inside a circle
graph, flower graph, double wheel and cylinder graph.
Keywords: vertex polynomial, open star, lotus inside a circle graph, flower, double wheel,
cylinder.

1. Introduction

In this paper we mean only simple graphs. For notation and terminology, I refer to [2].
Sukumaran and Devaraj [1] introduced the concept of Vertex polynomial in graphs. Denoted
vertex set by V(G) and edge set by E(G). For v  V , deg( v) is the number of edges incident
with v, the maximum degree of G is defined as (G )  max{ deg( v) / v  V } . In this paper we
find the vertex polynomial of open star of some graphs. The graph G = (V, E) is simply
denoted by G. We use the following definitions in the subsequent sequel.
Definition 1.1.[3,4] Let G be a graph with a vertex u. The graph obtained from a star K 1, n

and n(  3) copies of G by identifying the ith end vertex of K 1, n to vertex u of the ith copy of

G is known as an open star of G, denoted by OS(n,G).

Definition 1.8. The lotus inside a circle graph LCn is obtained from the cycle Cn : u1, u2, . . .
un, u1 and a star K1,n with the central vertex v0 and the end vertices v1, v2, . . . , vn by joining
each ui and ui+1(mod n).
Definition 1.2. The flower graph Fln is obtained from a helm Hn by joining each pendent
vertex to the central vertex of the helm.

Definition 1.3. A double wheel graph DWn of size n can be composed of 2Cn + K1, that is, it
consists of two cycles of size n, where the vertices of the two cycles are all connected to a
common hub.

Definition 1.4. The graph (Cn  P2) is called cylinder graph.

2. Main Results

In this section I find out the vertex polynomial of lotus inside a circle graph, flower
graph, double wheel and cylinder graph.
1
THEOREM 2.1. The vertex polynomial of open star of lotus inside a circle graph LCn is

V (OS (n, LCn ), x)  (n  1) x n  nx5  n(n  1) x 4  n 2 x3 , n  4.

PROOF. Let OS(n,LCn) , n  4 be an open star of lotus inside a circle graph. Let

V(OS(n,LCn))= {u, w j , vij , uij : 1  i  n, 1  j  n} and E(OS (n, LCn ))  {uu1j :1  j  n}{w j vij :

1  i  n,1  j  n}  {vij u ij :1  i  n,1  j  n} {vij u ij1 :1  i  n  1,1  j  n}  {v nj u1j :1  j  n}

 {u ij u ij1 :1  i  n  1,1  j  n} {u nj u1j :1  j  n}.

OS(n,LCn) has 2n2 + n + 1 vertices and 4n2 + n edges. Among this, (n+1) vertices have
degree n, n vertices have degree 5, n(n –1) vertices have degree 4 and n2 vertices have degree
3. This gives, V (OS (n, LCn ), x)  (n  1) x n  nx 5  n(n  1) x 4  n 2 x 3 .

EXAMPLE.2.1. Open star of lotus inside a circle graph, OS(4,LC4) is shown in Figure 1.

Figure 1. Open star of lotus inside a circle graph OS(4,LC4)

THEOREM 2.2. The vertex polynomial of open star of flower graph OS (n, Fln ) is

V (OS (n, Fln ), x)  x n  nx 2 n  n 2 x 4  n 2 x 2 , n  3.

PROOF. Let OS(n,Fln) , n  3 be an open star of flower graph. Let V(OS(n,Fln)) =

{u, w j , vij , uij : 1  i  n, 1  j  n} and E (OS (n, Fln ))  {uv1j :1  j  n}{vij vij1 :1  i  n  1,

1  j  n}  {vnj v1j : 1  j  n}  {w j vij :1  i  n, 1  j  n}  {vij uij :1  i  n, 1  j  n}  {w j uij :

1  i  n, 1  j  n}.

2
OS(n,Fln) has 2n2 + n + 1 vertices and 4n2 + n edges. Among this, one vertex have degree n,
n vertices have degree 2n, n2 vertices have degree 4 and n2 vertices have degree 2. This gives,
V (OS (n, Fln ), x)  x n  nx 2 n  n 2 x 4  n 2 x 2 .

EXAMPLE.2.2. Open star of flower graph, OS(3,Fl3) is shown in Figure 2.

Figure 2. Open star of flower graph, OS(3,Fl3)

THEOREM 2.3. The vertex polynomial of open star of double wheel OS (n, DWn ) is

V (OS (n, DWn ), x)  n(2n  1) x 3  nx 4  x n  nx 2 n , n  3.

PROOF. Let OS(n,DWn) , n  3 be an open star of double wheel graph. Let V(OS(n,DWn)) =

{u, w j , vij , uij : 1  i  n, 1  j  n} and E (OS (n, DWn ))  {uu1j :1  j  n} {vij vij1 , uij uij1 :

1  i  n  1, 1  j  n  1}  {vnj v1j , unj u1j : 1  j  n} {w j vij :1  i  n,1  j  n} 

{w j uij :1  i  n,1  j  n}.

OS(n,DWn) has 2n2 + n + 1 vertices and 4n2 + n edges. Among this, n(2n – 1) vertices have
degree 3, n vertices have degree 4, one vertex have degree n and n vertices have degree 2n.
This gives, V (OS (n, DWn ), x)  n(2n  1) x3  nx 4  x n  nx 2 n .
EXAMPLE.2.3. Open star of flower graph, OS(4,DW4) is shown in Figure 3.

3
 Figure 2. Open star of flower graph, OS(3,Fl3)

THEOREM 2.4. The vertex polynomial of open star of cylinder graph OS (n, Cn  P2 ) is

V (OS (n, C n  P2 ), x)  n(2n  1) x 3  nx 4  x n , n  3.

PROOF. Let OS (n, Cn  P2 ) , n  3 be an open star of cylinder graph. Let V( OS (n, Cn  P2 ) ) =

{u, vij , uij : 1  i  n, 1  j  n} and E (OS (n, Cn  P2 ), x)  {uu1j :1  j  n}  {vij vij1 , uij uij1 :

1  i  n  1, 1  j  n  1}  {vnj v1j , u nj u1j : 1  j  n}{vij uij :1  i  n,1  j  n}.

OS (n, Cn  P2 ) has 2n2 +1 vertices and 3n2 + n edges. Among this, n(2n – 1) vertices have
degree 3, n vertices have degree 4 and one vertex have degree n. This gives,
V (OS (n, Cn  P2 ), x)  n(2n  1) x 3  nx 4  x n .

EXAMPLE.2.4. Open star of cylinder graph, OS (4, C4  P2 ) is shown in Figure 4.

4
 Figure 4. Open star of cylinder graph, OS (4, C4  P2 )

References
[1]. Devaraj J, Sukumaran E, On Vertex Polynomial,IJMSEA, 6(1)(2012), 371-380.
[2]. Harary F, Graph Theory, Narosa Publishing House(1969).
[3]. Jeyanthi P, Jeya Daisy K, Zk - Magic Labeling of Open Star of Graphs, Bulletin of the
International Mathematical Virtual Institute, 7(2017), 243-255.
[4]. Kaneria V.J, Meghpara M and Makadia H.M, Graceful labeling for open star of graphs,
Inter. J. Math. Stat. Invention, 2(9)(2014), 19–23.