On the Coefficients of the Vertex - Cover Polynomials of Wheels
AYYAKUTTY VIJAYAN1 and BERNONDES STEPHEN JOHN2
1Assistant Professor, Department of Mathematics, Nesamony Memorial Christian College, Marthandam
Kanyakumari District, Tamil Nadu, 629165, India.
2Assistant Professor, Department of Mathematics Annai Velankanni College, Tholayavattom Kanyakumari District, Tamil Nadu, 629157, India.
(Received on: February 27, 2012) ABSTRACT
The vertex cover polynomial of a graph G of order n has been already introduced in3. It is defined as The polynomial.
C (G, x) =
| V(G) |
i (G)=
Σ
β C (G, i) xiwhere c (G, i) is the number of vertex covering sets of G of size i and β (G) is the covering number of G. We obtain some properties of the coefficients of the vertex cover polynomial of the wheels. We obtain some recurrence relations for the coefficients of the vertex cover polynomials of wheels we establish some relation between the coefficients of the vertex cover polynomials of wheels and paths ; wheels and cycles.
Keywords: Vertex covering sets : vertex cover number, vertex cover polynomial.
INTRODUCTION
Let G = (V, E) be a simple graph.
For any vertex v 0 V, the open neighborhood of v is the set N (v) = { u 0 V/ uv 0 E} and the closed neighborhood
of v is the set
N [v] = N (v) χ {v}. For a set S φV, the
open neighborhood of S is
N (s) =
v S
U
∈ N (v) and the closed neighborhood of S is N [S] = N (S) χ S .A set S φV is a vertex covering of G if every edge uv 0 E is adjacent to atleast one vertex in S. The vertex covering number β (G) is the minimum cardinality of the minimum vertex covering sets in G.
A vertex covering set with cardinality β (G) is called a β set. Let C (G, i) be the family of vertex covering sets with cardinality i and let c (G, i) = | C (G, i)|. The polynomial C (G, x) =
| V(G) |
i (G)=
Σ
β c (G, i) xi isdefined as the vertex cover polynomial of G. In3, many properties of the vertex cover polynomial have been studied and derived the vertex cover polynomials for some standard graphs. In this paper, we derived some properties of the coefficients of the vertex cover polynomials of wheels. Also, we obtain some relationship between the coefficients of vertex cover polynomials and paths ; wheels and cycles.
The number of edges incident to the vertex v of a graph G is called the degree of the vertex v in G. It is denoted by deg (v). δ (G) and ∆ (G) are the minimum and
maximum of the degree of the vertices in G respectively.
2. VERTEX COVER POLYNOMIAL
Definition 2.1
Let C (G, i) be the family of all vertex covering sets of G with cardinality i and let c (G, i) = | C (G, i)|. The vertex cover polynomial of G is defined as C (G, x) =
| V(G) |
i (G)=
Σ
β c (G, i) xi.In3 the vertex cover polynomial of paths, cycles and wheels are
obtained as C (Pn , x) =
n
i = n 1 2
−
Σ
ni i + 1 n − i xi; C (Cn, x) = ni = n 2
Σ
ni n i− i xiC (Wn, x) = xn – 1 +
n
n + 1 i =
2
Σ
n i −− 1 1 i n −− 1 i xi .Theorem 2.2
The coefficients of the vertex cover polynomials the wheels have the following properties:
i) c (W2n + 1, n + 2) = n2 , n ∃ 2
ii) c 2n + 1 2n 1
W ,
2
+
= 2 , n ∃ 2
iii) c (wn, n – 2) = c (wn – 1, n – 3) + c (w n – 2, n – 3) – 1 , n > 4 iv) c (Wn, n – 2) = c (Wn – 1, n – 2) + c (Wn – 1, n – 3) – 2 , n > 4 v) c (Wn, n – 1) = c (Wn – 1, n – 2) + c (Wn – 2, n – 2), n > 4 vi) c (Wn, n – 3) = c (Wn – 1, n – 4) + c (Wn – 2, n – 4) , n > 4
where c (Wn, i) = n 1 i 1
i 1 n i
− −
− −
if i ≠ n – 1 and c (Wn, i) = n 1 i 1 1i 1 n i
− −
− − +
; if i = n – 1 Proof :i) c (W2n + 1 , n + 2) =
n + 2 1 2n + 1 1
n + 2 1 2n + 1 n + 2
−
−
− −
= 2n n 1
n + 1 n 1 +
−
= 2n n 1
n 1 2 +
+
= n2.
ii) 2n + 1 2n 1 2
c W ,
+
= c (W2n + 1, n + 1)2n 1
= n + 1 2
+
Q
=
n + 1 1 2n + 1 1
n + 1 1 2n + 1 n + 1
−
−
− −
= 2n n
n n
= 2
iii) R.H.S =
c (Wn – 1, n – 3) + c (Wn – 2, n – 3) – 1
=
n 3 1 n 3 1
n 1 1 n 2 1
+ 1 1
n 3 1 n 1 n 3 n 3 1 n 2 n 3
− − − −
− − − − + −
− − − − − − − − − −
=
n 4 n 4
n 2 n 3
+
n 4 2 n 4 1
− −
− −
− −
= n 2 (n 4)(n 5)
. + (n 3)
n 4 2
− − −
− −
=
n
25n + 4 2
−
= (n 1) (n 4) 2
− −
= n 1 (n 3)(n 4)
n 3 2
− − −
−
= n 1 n 3
n 3 2
−
−
−
= n 1 n 2 1
n 3 n n 2
− −
−
− − − = c (Wn, n – 2)
= L.H.S.
Therefore, c (Wn, n – 2) = c (Wn – 1 , n – 3) + c (Wn – 2 , n – 3) – 1 (iv) R.H.S =
c (Wn – 1, n – 2) + c (wn – 1, n – 3) – 2 = (n – 1) +
n 3 1 n 1 1
n 3 1 . n 1 n 3
− −
− −
− − − − −
[ c (Wn, n – 1) = n]= n – 1 +
n 4 n 2
n 4 . 2
−
−
−
– 2
= n – 3 + (n 2)(n 5) 2
− −
= 2 (n 3) + (n 2) (n 5) 2
− − −
(A)
=
n
25n 4 2
− +
= c (Wn, n –2) [ by (A) in (iii) ]
= L.H.S
v) R.H.S. = c (Wn – 1, n – 2) + c (Wn – 2, n – 2) = n – 1 + 1
= n
= (Wn, n – 1) [ c (Wn, n) = 1 ; c (Wn, n – 1) = n]
= L.H.S
vi) R.H.S = c (Wn – 1 , n – 4) + c (Wn – 2, n – 4)
=
n 4 1 n 4 1
n 1 1 n 2 1
+
n 4 1 n 1 n 4 n 4 1 n 2 n 4
− − − −
− − − −
− − − − − − − − − −
= n 2 n 5 n 3 n 5
+
n 5 3 n 5 2
− −
− −
− −
= n 2 (n 5) (n 6) (n 7) (n 3) (n 5) (n 6)
+
n 5 3! (n 5) 2!
− − − − − − −
− −
= (n – 6)
(n 2) (n 7) + 3(n 3) 3!
− − −
= n 6 3!
− [n2 – 6n + 5]
= n 6 3!
− [ (n – 5) (n – 1) ]
= n 1 3!
− [ (n – 5) (n – 6) ]
=
n 1 (n 4) (n 5) (n 6)
n 4 . 3!
− − − −
−
= n 1 n 4 n 4 3
−
−
−
=
n 3 1 n 1
n 3 1 n n 3
− −
−
− − − −
= c (Wn, n – 3)
= L.H.S.
Theorem : 2.3
The coefficients of the vertex cover polynomials of the wheels satisfy the following identity :
i 5=
Σ
∞ c (Wi, n) = 2i 4=
Σ
∞ c (Wi, n – 1) – 1.Proof :
When i < n or i > 2n – 1 , c (Wi , n) = 0 Therefore the above relation reduces to
2n 1 i n=
Σ
− c (Wi, n) = 22n 3 i n 1=
−
Σ
− c (Wi, n – 1) – 1.R.H.S. =
2n 3 i n 1=
−
Σ
− 2 c (Wi, n – 1) – 1= 2 [c (Wn – 1, n – 1) + c (Wn, n – 1) + (Wn + 1, n – 1) + . . . + c (W2n – 4, n – 1) + c (W2n – 3, n – 1) – 1.
= 2
n 2 n 2
n 2 n 1
+ + 1
n 2 0 n 2 n n 1
− − − −
− − − −
+ n + 1 1 n 1 1 n 1 1 n 1 n 1
− −
−
− − + − −
+ . . . + 2n 4 1 n 1 1 n 1 1 2n 4 n 1
− −
− −
− − − − −
n 1 1
2n 3 1
+ 1
n 1 1 2n 3 n 1
− −
− − −
− − − − −
= 2
n 2 n 1 n 2 n n 2
+ + 1 + . . . +
n 2 n 2
0 1 2
− − − −
+
− −
n 2 n 2
2n 5 2n 4
+
n 2 n 3 n 2 n 2
− −
− −
− − − −
– 1 (1)
=
n 2 n 2 n 1 n 1 n (n 3)
+ + + + + . . . +
0 0 1 1 2
− − − −
−
n 2 n 2 n 2
2n 5 2n 4 2n 4
+ +
n 2 1 n 2 0 n 2 0
− − − − − −
− − −
+ 2 – 1
=
n 2 (n 2) (n + 1)
+ [1 + n 1] + 0 2
−
−
−
+ . . . + (2n – 3)] + 2 + 1
= n 1 (n 2) (n + 1)
+ n + + . . . + (2n 3) + 2 + 1 0 2
−
−
−
= n 1 n n 1 n + 1 (n 1) (n 2)
+ + . . .
n 1 n 1 2!
0 1
− −
− −
+ +
− −
n 1 n 1
2n 3 2 (n 1)
+ + 1
n 1 n 2 n 1 n 1
− −
− −
− − − −
= n 1 n n 1 n + 1 n 1
+ + . . .
n 1 n 1 2
0 1
− −
−
+ +
− −
n 1 n 1
2n 3 2 n 2
+
n 1 n 2 n 1 n 1
− −
− −
− − − −
+ 1
=
n 1 n 1 n 1
n 1 n n + 1
+ 1 + + + . . .+
n 1 0 n 1 n + 1 n n 1 n + 2 n
− − −
−
− − − − −
2 n 2 1 n 1 2 n 1 1 n 1
+
n 1 2n 2 n n 1 2n 1 n
− −
− − − −
− − − − − −
= c (Wn, n) + c (Wn + 1, n) + c (Wn + 2, n) + . . + (W2n – 2, n) + c (W2n – 1, n)
=
2n 1 i n=
Σ
− c (wi, n)Hence , we have,
i 5=
Σ
∞ c (Wi, n) = 2i 4=
Σ
∞ c (Wi, n – 1) – 1.Theorem 2.4
The coefficients of the vertex cover polynomials of the wheels satisfies the following recurrence relation:
n + 1
n 2 i =
2 +
Σ
c (Wn + 1, i) + 1 =n 1
i = n 2
−
Σ
c (Wn – 1, i) +n
n 1 i =
2 +
Σ
c (Wn, i)Proof:
First we take n = 2k, Therefore,
n
2
= k ;n + 1 2
= k + 1 andn + 2 2
= k + 1 R.H.S. =n 1
i = n 2
−
Σ
c (Wn – 1, i) +n
n 1 i =
2 +
Σ
c (Wn, i)=
2k 1 i k=
Σ
− c (Wn – 1, i) +2k
i k + 1=
Σ
c (Wn, i)= c (Wn – 1, k) + c (Wn – 1, k + 1) + c (Wn – 1, k + 2)
+ . . . + c (Wn – 1, 2k – 2) + c (Wn – 1, 2k – 1) + c (Wn, k + 1) + c (Wn, k + 2) + c (Wn, k + 3) + . . . + c (Wn, 2k – 1) + c (Wn, 2k)
=
k 1 k k + 1
n 2 n 2 n 2
+ +
k 1 n 1 k k n 1 k + 1 k + 1 n 1 k + 2
−
− − −
− − − − − − −
2k 3 2k 2
n 2 n 2
.... 1 + +
2k 3 n 1 2k 2 2k 2 n 1 2k 1
− −
− −
+ + − − − − − − − −
k k + 1 k + 2
n 1 n 1 n 1
+ + +
k n k + 1 k 1 n k + 2 k 2 n k 3
− − −
− + − + − +
+ . . . + 1 +
2k 2 2k 1
n 1 n 1
+
2k 2 n 2k 1 2k 1 n 2k
− −
− −
− − − − −
=
k 1 k k + 1
n 2 n 2 n 2
+ + . . . +
k 1 k 1 k k 2 k + 1 k 3
−
− − − +
− − − −
2k 3 2k 2
n 2 n 2
+
2k 3 1 2k 2 0
− −
− −
− −
+
k k + 1 k + 2
n 1 n 1 n 1
+ + . . . +
k k 1 k + 1 k 2 k + 2 k 3
− − − − − − +
2k 2 2k 1
n 1 n 1
+ + 2
2k 2 1 2k 1 0
− −
− −
− −
=
k k + 1
2k 2 n 2 n 2
+ + + . . . +
k 1 k 2 k + 1 4
− − −
−
2k 3 2k 2
n 2 2k 2
+
2k 3 1 2k 2 0
− −
− −
− −
n 1 k
k k 1
−
+ −
k + 1 k + 2
n 1 n 1
+ + + . . . +
k + 1 3 k + 2 5
− −
2k 2 n 1
2k 2 1
−
−
−
2k 1 2k 1
+ + 2
2k 1 0
−
−
−
= 2 +
k k
n 2 n 1
k 2 + k k 1
− −
−
k + 1 k + 1
n 2 n 1
+ +
k + 1 4 k + 1 3
− −
2k 2 2k 2 2k 1
2k 2 n 1 2k 1
.... + + 2
2k 2 0 2k 2 1 2k 1 0
− − − − − −
+ + − − − +
=
(n 2) (k 1)
2 + + n 1
2
− −
−
(n 2) k (k 1) (k 2) (n 1) k (k 1)
+ +
4! 3!
− − − − −
+ . . . + [1 + n – 1]+
2k 1 0
−
+ 2
= 2
(2k 2) (k 1) + 2 (2k 2)
+ 2!
− − −
+
(2k 2) k (k 1) (k 2) + 4 (2k 1) k(k 1) 4!
− − − − −
+ . . . + 2k +2k 1 0
−
+ 2
= 2 +
2 4 2
2k (2k 2k ) +
2 4!
−
+ . . + 2k + 2k 1 0−
+ 2
= 2 +
2k 1 2.k k 2k (k + 1) (k) (k 1)
+ + . . . + 2k + + 2
2 4! 0
−
−
=
k + 1 k + 2
2k 2k 2k
+ + + . . . +
k k + 1 2 k + 2 4
2k 1 2k
2k 2k
+ + 2
2k 1 1 2k 0
−
−
2k = 2k 1
0 0
−
Q
=
k k + 1 k + 2
n n n
+ + + . . . +
k k k + 1 k 1 k + 2 k 2
− −
+
2k 1 2k
n n
+ + 2
2k 1 1 2k 0
−
−
=
k k k + 2
n n n
+ +
k n 1 k 1 k + 1 n 1 k 2 k + 2 n 1 k 3
+ − + + − + + − +
+ . . . +
2k 1 2k
n n
1 + + + 1
2k 1 n 1 2k 2k n 1 2k+1
−
−
+ − + −
= c (Wn + 1, k + 1) + c (Wn + 1, k + 2) = c (Wn + 1, k + 3) + . . . + c (Wn + 1, 2k) + c (Wn + 1, 2k + 1) + 1.
=
2k 1 i k+1=
Σ
+ c (Wn + 1, i) + 1 = L.H.SSimilarly, for n = 2k + 1 the above result follows.
Theorem 2.5
The coefficients of the vertex cover polynomials of the paths, wheels and cycles satisfy the following identities.
i)
i 4=
Σ
∞ c (Wi, n) =i 3=
Σ
∞ c (Ci, n – 1) + 1ii)
i 4=
Σ
∞ c (Wn + 1, i) =i 3=
Σ
∞ c (Cn, i) + 1iii) c (Cn, n – 2) + 1 = c (Pn, n – 2) Proof :
1) By Theorem 2.4 of [3] , we have c (Wn, x) = x C (Cn – 1, x) + xn – 1.
Therefore, c (Wi, n) = c (Ci – 1, n – 1) , i = n, n + 1, . . . ,
2n 1 −
and c (Wn, n – 1) = c (Cn – 1, n – 2) + 1 [ by (A) ] when i < n or i > 2n – 1, c (Wi , n) = 0when i < n – 1 or i > 2n – 2, c (Ci , n – 1 ) = 0
R.H.S =
2n 2 i n 1=
−
Σ
− c (Ci, n – 1) + 1= c (Cn– 1 , n – 1) + c (Cn, n – 1) + c (Cn + 1, n – 1) + . . . + c (C2n – 3, n – 1) + . . . + c (C2n – 2, n – 1) + 1
= c (Cn – 1, n – 1) + [c (Cn, n – 1) + 1] + c (Cn + 1, n – 1) + . . . + c (C2n – 3, n – 1) + c (C2n – 2, n – 1)
= c (Wn, n) + c (Wn + 1, n) + c (Wn + 2, n) + . . . + c (W2n – 2, n – 1) + c (W2n – 1, n – 1).
=
2n 1 i n=
Σ
− c (Wi, n)ii)
n
i = n + 1 2
Σ
c (Wn + 1, i) =n 1
i = n 2
−
Σ
c (Cn, i) + 1When i <
n 2
+ 1 or i > n, C (Wn + 1 , i) = 0 Also, when i <n
2
or i > n – 1, c (Cn , i) = 0 First we take, n = 2kTherefore ,
2k
i k +1=
Σ
C (Wn +1, i) =2k
i k
Σ
= c (Cn, i) + 1R.H.S =
2k 1 i k=
Σ
− (Cn, i) + 1 = c (Cn, k) + c (n, k + 1) + ...+ c (Cn, 2k – 2) + c (Cn, 2k – 1) + 1= c (C2k, k) + c (C2k, k + 1) + . . . + c (C2k, 2k – 2 + [c (C2k, 2k – 1)) + 1]
= c (W2k + 1, k + 1) + c (W2k + 1, k + 2) + . . .+ c(W2k + 1,2k – 1) + c (W2k + 1, 2k) = c (Wn +1, k + 1) + c (Wn + 1, k + 2) + . . . + c (Wn + 1, 2k)
=
n
i k +1=
Σ
c(Wn + 1 , i)(iii) c (Cn, n – 2) + 1 = n n 2
+ 1 n 2 n n 2
−
− − −
=
n 2
n + 1
n 2 2
−
−
= n (n 3) + 1 2
−
=
n
23n 1 2
− +
= (n 1) (n 2) 2
− −
= n 1 2
−
=
n 2 1 n n 2
− +
− −
= c (Pn, n – 2)
n
n
n i
c (C , i)
n i i
i + 1 c (P , i)
n i
= −
= −
Q
REFERENCES
1. Alikhani. S and Peng. Y.H. Introduction to Domination Polynomial of a Graph.
arXiv : 09052241 v1 [math.co] 14 May (2009).
2. Alikhani. S. and Peng. Y.H. Domination Sets and Domination polynomials of cycles. Global Journal of Pure and Applied Mathematics, Vol. 4, No. 2, (2008).
3. Dong. F.M, Hendy M.D, Teo K.L.
Little. C.H.C. The vertex – cover polynomial of a graph, Discrete Mathematics 250,71 – 78 (2002).
4. Douglas B. West, Introduction to Graph Theory.
5. Frucht. R and Harary. F, Corona of two graphs, A equations. Math. 4, 322-324 (1970).
6. Gary Chartrand and Ping Zhang;
Introduction to Graph Theory.