ADALYA JOURNAL https://doi.org/10.37896/aj9.

10/003 ISSN NO: 1301-2746

CONNECTED VERTEX-EDGE DOMINATING SETS AND CONNECTED

DOMINATION POLYNOMIALS OF SQUARE OF PATHS
V. S. Radhika
Research Scholar (Part time)
Register Number : 17213112092015
Nesamony Memorial Christian College, Marthandam,
Kanyakumari District, Tamil Nadu, India.

A.Vijayan
Research Department of Mathematics,
Nesamony Memorial Christian College, Marthandam,
Kanyakumari District, Tamil Nadu, India.

[Affiliated to ManonmaniamSundaranar University,Abishekapatti,

Tirunelveli-627012, Tamil Nadu, India]
Abstract
Let 𝑮 be a simple connected graph of order 𝒏.Let𝑫𝒄𝒗𝒆 (𝑮, 𝒊) be the family of
connected vertex - edge dominating sets in 𝑮 with cardinality 𝒊 .The polynomial
𝑫𝒄𝒗𝒆 (𝑮, 𝒙)=∑𝒏𝒊 𝜸𝒄𝒗𝒆 𝒅𝒄𝒗𝒆 (𝑮, 𝒊) 𝒙𝒊 is called the connected vertex - edge domination
polynomial of G, where 𝒅𝒄𝒗𝒆 (𝑮, 𝒊) is the number of connected vertex - edge
dominating sets of G. In this paper, we obtain a recursive formula for 𝑫𝒄𝒗𝒆 (𝑷𝟐𝒏 , 𝒊) .
Using this formula, we construct the connected vertex - edge domination polynomial
𝑫𝒄𝒗𝒆 (𝑷𝟐𝒏 , 𝒙) = ∑𝒏 𝒏 𝟒 𝒅𝒄𝒗𝒆 (𝑷𝟐𝒏 , 𝒊) 𝒙𝒊 , where 𝒅𝒄𝒗𝒆 (𝑷𝟐𝒏 , 𝒊) is the number of the
𝒊
𝟐
connected vertex - edge dominating sets of 𝑷𝟐𝒏 of cardinality 𝒊 and some properties of
this polynomial have been studied.
Keywords :
Square of path, connected vertex- edge dominating set, connected vertex- edge,
domination number, connected vertex - edge domination polynomial.
I. INTRODUCTION
Let 𝐺 = ( 𝑉, 𝐸 ) be a simple graph of order 𝑛. For any vertex 𝑣 ∈ 𝑉, the open
neighbourhood of 𝑉 is the set 𝑁 (𝑣 ) = { 𝑢 ∈ 𝑉/𝑢𝑣 ∈ 𝐸} and the closed neighbourhood of
𝑣 is the set 𝑁[𝑣] = 𝑁(𝑣 )𝑈 {𝑣}.For a set S ⊆ 𝑉, the open neighbouhood of 𝑆 is N(S)
=⋃ ∈ 𝑁(𝑉) and the closed neighbourhood of S is 𝑁[𝑆] = 𝑁 (𝑠) ∪ 𝑆.
A vertex 𝑢 ∈ 𝑉(𝐺) vertex- edge dominates ( ve- dominates) an edge 𝑣𝑤 ∈ 𝐸(𝐺) if
1. 𝑢 = 𝑣 or 𝑢 = 𝑤 (𝑢 is incident to 𝑣𝑤) or
2. 𝑢𝑣 or 𝑢𝑤 is an edge in 𝐺 (𝑢 is incident to an edge that is adjacent to 𝑣𝑤)
A vertex - edge dominating set S of G is called a connected vertex edge
dominating set if the induced subgraph〈𝑆〉 is connected.

Volume 9, Issue 10, October 2020 15 http://adalyajournal.com/

ADALYA JOURNAL https://doi.org/10.37896/aj9.10/003 ISSN NO: 1301-2746

The minimum cardinality of a connected vertex - edge dominating set of 𝐺 is

called the connected vertex - edge domination number of 𝐺 and is denoted of 𝛾 (𝐺).A
connected vertex - edge dominating set with cardinality 𝛾 (𝐺) is called 𝛾 − set.
We use the notation ⌈𝑥⌉ for the smallest integer greater than or equal to x and ⌊𝑥⌋
for the largest integer less than or equal to 𝑥. Also, we denote the set { 1, 2, … , 𝑛}by [𝑛],
throughout this paper.

II. CONNECTED VERTEX - EDGE DOMINATING SETS OF SQUARE OF

PATHS
Here, we find the connected vertex - edge domination number of the square of path
and some of its properties.
Definition : 2.1
Let 𝐺 be a graph of order 𝑛 with no isolated vertices. Let 𝐷 (𝐺, 𝑖) be the family
of connected total dominating sets of G with cardinality 𝑖 and let 𝑑 (𝐺, 𝑖) =|𝐷 (𝐺, 𝑖)|.
Then the connected vertex - edge domination polynomial 𝐷 (𝐺, 𝑥) of 𝐺 is defined as
𝐷 (𝐺, 𝑥) =∑ ( )𝑑 (𝐺, 𝑖) 𝑥 .
Lemma : 2.2
Let 𝑃 be the square of the path 𝑃 with n - vertices, then its connected vertex-
edge domination number is 𝛾 (𝑃 )= .
Lemma : 2.3
Let 𝑃 , 𝑛 ≥ 8 be the square of path with |𝑉( 𝑃 )|= n. Then 𝑑 (𝑃 , 𝑖) = 0 if 𝑖 <
or 𝑖 > 𝑛 and 𝑑 (𝑃 , 𝑖) > 0 if ≤ 𝑖 ≤ 𝑛.
Proof :
If𝑖 < or> 𝑛 , then there is no connected vertex - edge dominating set of
cardinality 𝑖. Therefore, 𝑑 (𝑃 , 𝑖) = 𝜑. By lemma 2.2, the cardinality of the minimum
connected vertex - edge dominating set is . Therefore,𝑑 (𝑃 , 𝑖) > 0 if 𝑖 ≥
and 𝑖 ≤ 𝑛. Hence, we have 𝑑 (𝑃 , 𝑖) = 0if 𝑖< or 𝑖 > 𝑛 and 𝑑 (𝑃 , 𝑖 ) > 0if
≤ 𝑖 ≤ 𝑛.
Lemma : 2.4
Let 𝑃 , n ≥ 8 be the square of path with |V(𝑃 )| = 𝑛.
Then,
1. 𝐷 (𝑃 , 𝑖) = 𝜑 if 𝑖 < 𝛾 (𝑃 ) or 𝑖 > 𝑛 .
2. 𝐷 (𝑃 , 𝑥 )has no constant term and first degree terms.
3. 𝐷 (𝑃 , 𝑥 ) is a strictly increasing function on [ 0,∞)

Lemma : 2.5
Let 𝑃 , n ≥ 8 be the square of path with |V(𝑃 )| = 𝑛.
Then,
1. 𝐷 (𝑃 , 𝑖 − 1) = 𝜑and𝐷 (𝑃 , 𝑖 − 1) ≠ 𝜑 then 𝐷 (𝑃 , 𝑖 − 1) = 𝜑.
2. If 𝐷 (𝑃 , 𝑖 − 1) ≠ 𝜑and 𝐷 (𝑃 , 𝑖 − 1) ≠ 𝜑then 𝐷 (𝑃 , 𝑖 − 1) ≠ 𝜑.
3. If 𝐷 (𝑃 , 𝑖 − 1) = 𝜑,𝐷 (𝑃 , 𝑖 − 1) = 𝜑 and 𝐷 (𝑃 , 𝑖 − 1) = 𝜑 then
𝐷 (𝑃 , 𝑖) = 𝜑.

Volume 9, Issue 10, October 2020 16 http://adalyajournal.com/

ADALYA JOURNAL https://doi.org/10.37896/aj9.10/003 ISSN NO: 1301-2746

Proof
Since 𝐷 (𝑃 , 𝑖 − 1) = 𝜑and 𝐷 (𝑃 , 𝑖 − 1) = 𝜑 , by Lemma 2.3, 𝑖 − 1 >
𝑛 − 1 or 𝑖 − 1 < and 𝑖 − 1 > 𝑛 − 3 or 𝑖 − 1 < .Therefore, 𝑖 − 1 > 𝑛 − 1

or 𝑖−1< .Hence, 𝑖−1>𝑛−2 or 𝑖−1< holds.Therefore,

𝐷 (𝑃 , 𝑖 − 1) = 𝜑.
1. Suppose that 𝐷 (𝑃 , 𝑖 − 1) = 𝜑, so by Lemma 2.3, We have 𝑖 − 1 > 𝑛 − 2 or
𝑖−1< . If 𝑖 − 1 > 𝑛 − 2 then 𝑖 − 1 > 𝑛 − 3 .

Therefore,𝐷 (𝑃 , 𝑖 − 1) = 𝜑 , a contradiction.If 𝑖 − 1 < , then 𝑖 − 1 <

. Therefore, 𝐷 (𝑃 , 𝑖 − 1) = 𝜑 , a contradiction.Therefore, our

assumption is wrong.Therefore, 𝐷 (𝑃 , 𝑖 − 1) ≠ 𝜑
By hypothesis, 𝑖 − 1 < or 𝑖 − 1 > 𝑛 − 1 and 𝑖 − 1 < or 𝑖 − 1 > 𝑛 − 2

and 𝑖 − 1 < or 𝑖 − 1 > 𝑛 − 3.Therefore, 𝑖 − 1 < or 𝑖 − 1 > 𝑛 −

1.Therefore, 𝑖 < or 𝑖 > 𝑛. Therefore, 𝐷 (𝑃 , 𝑖) = 𝜑.

Lemma : 2.6
Let 𝑃 , 𝑛 ≥ 8 be the square of path with |𝑉(𝑃 )| = 𝑛. Suppose that
𝐷 (𝑃 , 𝑖) ≠ 𝜑, then we have,
1. 𝐷 (𝑃 , 𝑖 − 1) = 𝜑 and 𝐷 (𝑃 , 𝑖 − 1) = 𝜑 if and only if 𝑛 = 2𝑘 + 1 and
𝑖 = 𝑘 − 2 for some 𝑘 ≥ 5.
2. 𝐷 (𝑃 , 𝑖 − 1) = 𝜑 , 𝐷 (𝑃 , 𝑖 − 1) = 𝜑 and 𝐷 (𝑃 , 𝑖 − 1) ≠ 𝜑 if and
only if = 𝑛 .
3. 𝐷 (𝑃 , 𝑖 − 1) ≠ 𝜑 , 𝐷 (𝑃 , 𝑖 − 1) ≠ 𝜑 and 𝐷 (𝑃 , 𝑖 − 1) = 𝜑 if and
only if = 𝑛 − 1 .
4. 𝐷 (𝑃 , 𝑖 − 1) = 𝜑 , 𝐷 (𝑃 , 𝑖 − 1) ≠ 𝜑 and 𝐷 (𝑃 , 𝑖 − 1) ≠ 𝜑 if and
only if 𝑛 = 2𝑘 + 1 and 𝑖 = 𝑘 − 2 for some 𝑘 ≥ 5.
5. 𝐷 (𝑃 , 𝑖 − 1) ≠ 𝜑 , 𝐷 (𝑃 , 𝑖 − 1) ≠ 𝜑 and 𝐷 (𝑃 , 𝑖 − 1) ≠ 𝜑 if and
only if + 1 ≤ 𝑖 ≤ 𝑛 − 2.
Proof :
1. Assume 𝐷 (𝑃 , 𝑖 − 1) = 𝜑and 𝐷 (𝑃 , 𝑖 − 1) = 𝜑.
Then by lemma 2.3, 𝑖 − 1 > 𝑛 or 𝑖 − 1 < and 𝑖 − 1 > 𝑛 − 1 or 𝑖 − 1 <

.Suppose that −1 > 𝑛 − 1 , then 𝑖 > 𝑛. Therefore, 𝐷 (𝑃 , 𝑖) = 𝜑, which is

a contradiction.So, 𝑖 < + 1 and since 𝐷 (𝑃 , 𝑖) ≠ 𝜑 , we have

≤𝑖< +1 ...... (1)

If 𝑛 ≠ 2𝑘 + 1, then we obtain an inequality of the form 𝑠 ≤ 𝑖 < 𝑠, which is not
possible.When𝑛 = 2𝑘 + 1, (1) holds and in this case, 𝑖 = 𝑘 − 2. Conversely,
assume 𝑛 = 2𝑘 + 1 and 𝑖 = 𝑘 − 2. Therefore, 𝑛 − 1 = 2𝑘 and 𝑖 − 1 = 𝑘 − 3.

Volume 9, Issue 10, October 2020 17 http://adalyajournal.com/

ADALYA JOURNAL https://doi.org/10.37896/aj9.10/003 ISSN NO: 1301-2746

𝑘−3<𝑘−2 = − 2
= <

That is 𝑖 − 1<
Therefore, 𝐷 (𝑃 , 𝑖 − 1) = 𝜑
Also, 𝑖 − 1 = 𝑘 − 3
= −3
= < .
Therefore, 𝐷 (𝑃 , 𝑖 − 1) = 𝜑.
2. Assume 𝐷 (𝑃 , 𝑖 − 1) = 𝜑and 𝐷 (𝑃 , 𝑖 − 1) = 𝜑.
Then by lemma 2.3, we have
𝑖 − 1 > 𝑛 − 2or𝑖 − 1 < and 𝑖 − 1 > 𝑛 − 3 or 𝑖 − 1 < .

If 𝑖−1< , then𝑖 − 1 < .

Then by lemma 2.3, we have 𝐷 (𝑃 , 𝑖 − 1) = 𝜑, which is a contradiction.
So, we have 𝑖 − 1 > 𝑛 − 2.That is 𝑖 > 𝑛 − 1. Therefore 𝑖 ≥ 𝑛. Also
since𝐷 (𝑃 , 𝑖) ≠ 𝜑 , 𝑖 ≤ 𝑛. Combining these we get 𝑖 = 𝑛.Conversely, if 𝑖 = 𝑛.
𝐷 (𝑃 , 𝑖 − 1) = 𝐷 (𝑃 , 𝑛 − 1) = 𝜑
𝐷 (𝑃 , 𝑖 − 1) = 𝐷 (𝑃 , 𝑛 − 1) = 𝜑and
𝐷 (𝑃 , 𝑖 − 1) = 𝐷 (𝑃 , 𝑛 − 1) ≠ 𝜑
3. Assume 𝐷 (𝑃 , 𝑛 − 1) ≠ 𝜑 , 𝐷 (𝑃 , 𝑖 − 1) ≠ 𝜑 and 𝐷 (𝑃 , 𝑖 − 1) = 𝜑
Since 𝐷 (𝑃 , 𝑖 − 1) = 𝜑 , then by lemma 2.3,
𝑖 − 1 > 𝑛 − 3or 𝑖 − 1 < . …… (1)

Since 𝐷 (𝑃 , 𝑖 − 1) ≠ 𝜑, we have ≤𝑖−1≤𝑛−2 …… (2)

Suppose 𝑖 − 1 < , then ( 2) does not hold.

Therefore, out assumption is wrong,
Therefore, 𝑖 − 1 > 𝑛 − 3.
Also, since 𝐷 (𝑃 , 𝑖 − 1) ≠ 𝜑, ≤𝑖−1≤𝑛−2 …… (3)
But 𝑖 − 1 > 𝑛 − 3.
Therefore, 𝑖 − 1 ≥ 𝑛 − 2 …… (4)
From ( 3) and (4), we get 𝑖 − 1 = 𝑛 − 2
Therefore, 𝑖 = 𝑛 − 1. Conversely, suppose 𝑖 = 𝑛 − 1
Then 𝐷 (𝑃 , 𝑖 − 1) = 𝐷 (𝑃 , 𝑛 − 2) ≠ 𝜑
𝐷 (𝑃 , 𝑖 − 1) = 𝐷 (𝑃 , 𝑛 − 2) ≠ 𝜑 and
𝐷 (𝑃 , 𝑖 − 1) = 𝐷 (𝑃 , 𝑛 − 2) = 𝜑,since 𝑛 − 2 > 𝑛 − 3.
That is,𝐷 (𝑃 , 𝑖 − 1) = 𝜑.
4. Assume 𝐷 (𝑃 , 𝑖 − 1) = 𝜑,𝐷 (𝑃 , 𝑖 − 1) ≠ 𝜑 and 𝐷 (𝑃 , 𝑖 − 1) ≠ 𝜑.
Since 𝐷 (𝑃 , 𝑖 − 1) = 𝜑 , by lemma 2.3, 𝑖 − 1 > 𝑛 − 1 or 𝑖 − 1 < .

Volume 9, Issue 10, October 2020 18 http://adalyajournal.com/

ADALYA JOURNAL https://doi.org/10.37896/aj9.10/003 ISSN NO: 1301-2746

If 𝑖 − 1 > 𝑛 − 1, then 𝑖 − 1 > 𝑛 − 2 and 𝑖 − 1 > 𝑛 − 3.

Therefore, 𝐷 (𝑃 , 𝑖 − 1) = 𝜑 and 𝐷 (𝑃 , 𝑖 − 1) = 𝜑, which is a
contradiction.
Therefore, 𝑖 − 1 < . ……. (1)

Since 𝐷 (𝑃 , 𝑖 − 1) ≠ 𝜑, we have ≤ 𝑖 − 1 ≤ 𝑛 − 2 and since

𝐷 (𝑃 , 𝑖 − 1) ≠ 𝜑 , we have ≤𝑖−1 ≤𝑛−3 ……. (2)

Since 𝐷 (𝑃 , 𝑖) ≠ 𝜑, we have ≤ 𝑖 ≤ 𝑛 − 1.

Therefore, −1≤𝑖 ≤𝑛−2 ……. (3)

By combining all the above inequalities we have,
−1≤𝑖−1< ……. (4)
When 𝑛 ≠ 2𝑘 + 1 , we get an inequality of the form 𝑠 ≤ 𝑖 − 1 < 𝑠, which is not possible.
When 𝑛 = 2𝑘 + 1, we have 𝑠 ≤ 𝑖 − 1 < 𝑠 + 1. Therefore (4) holds hood.
In this case, 𝑖 = 𝑘 − 2. Conversely, assume 𝑛 = 2𝑘 + 1 and 𝑖 = 𝑘 − 2.
Therefore, 𝑛 − 1 = 2𝑘and 𝑖 − 1 = 𝑘 − 3.
Therefore ,𝑘 = and 𝑘 − 1 =
𝑖−1 =𝑘−3
= −3
= < .
Therefore, 𝐷 (𝑃 , 𝑖 − 1) = 𝜑
Also, 𝐷 (𝑃 , 𝑖 − 1) = 𝐷 (𝑃 , 𝑘 − 3) ≠ 𝜑,
Since = = 𝑘 − 3 and 𝐷 (𝑃 , 𝑖 − 1) =𝐷 (𝑃 , 𝑘 − 3) ≠ 𝜑
Since = = 𝑘 − 3.
5. Assume 𝐷 (𝑃 , 𝑖 − 1) ≠ 𝜑, 𝐷 (𝑃 , 𝑖 − 1) ≠ 𝜑 and 𝐷 (𝑃 , 𝑖 − 1) ≠ 𝜑.
Then by Lemma 2.3, we have, ≤ 𝑖 − 1 ≤ 𝑛 − 1, ≤ 𝑖 − 1 ≤ 𝑛 − 2 and

≤ 𝑖 − 1 ≤ 𝑛 − 3.

Also, since 𝐷 (𝑃 , 𝑖 ) ≠ 𝜑, we have ≤ 𝑖 ≤ 𝑛.

Therefore, − 1 ≤ 𝑖 − 1 ≤ 𝑛 − 1.Therefore, + 1 ≤ 𝑖 ≤ 𝑛 − 2.

Conversely, suppose + 1 ≤ 𝑖 ≤ 𝑛 − 2.

Therefore, ≤ 𝑖 − 1 ≤ 𝑛 − 3, and ≤ 𝑖 − 1 ≤ 𝑛 − 2, ≤ 𝑖 − 1 ≤ 𝑛 − 3 and

≤ 𝑖 − 1 ≤ 𝑛 − 1.
From these we obtain
𝐷 (𝑃 , 𝑖 − 1) ≠ 𝜑, 𝐷 (𝑃 , 𝑖 − 1) ≠ 𝜑and𝐷 (𝑃 , 𝑖 − 1) ≠ 𝜑.

Volume 9, Issue 10, October 2020 19 http://adalyajournal.com/

ADALYA JOURNAL https://doi.org/10.37896/aj9.10/003 ISSN NO: 1301-2746

Theorem : 2.7
For every 𝑛 ≥ 3 and 𝑛 >
1. 𝐷 (𝑃 , 𝑛 − 1) = {3,4,5,6,7, … } .
2. If 𝐷 (𝑃 , 𝑖 − 1) = 𝜑, 𝐷 (𝑃 , 𝑖 − 1) = 𝜑 and 𝐷 (𝑃 , 𝑖 − 1) ≠ 𝜑 then
𝐷 (𝑃 , 𝑖) = 𝐷 (𝑃 , 𝑛) = {1 ,2 , … , 𝑛} .
3. If 𝐷 (𝑃 , 𝑖 − 1) ≠ 𝜑, 𝐷 (𝑃 , 𝑖 − 1) ≠ 𝜑 and 𝐷 (𝑃 , 𝑖 − 1) = 𝜑 then
𝐷 (𝑃 , 𝑛 − 1) = {[𝑛] = {𝑥}/𝑥 ∈ [𝑛]}.
4. If 𝐷 (𝑃 , 𝑖 − 1) ≠ 𝜑, 𝐷 (𝑃 , 𝑖 − 1) ≠ 𝜑 then
𝐷 (𝑃 , 𝑖) = {𝑋 ∪ {𝑛}𝑖𝑓 𝑛 − 1 ∈ 𝑋} ∪ {𝑋 ∪ {𝑛 − 1}𝑖𝑓 𝑛 − 2 ∈ 𝑋} ∪
{𝑋 ∪ {𝑛 − 2}𝑖𝑓 𝑛 − 3 ∈ 𝑋} ∪
{𝑋 ∪ {𝑛 − 3}𝑖𝑓 𝑛 − 4 ∈ 𝑋} ∪
{𝑌 ∪ {𝑛}𝑖𝑓 𝑛 − 2 ∈ 𝑌} ∪ {𝑌 ∪ {𝑛 − 1}𝑖𝑓 𝑛 − 3 ∈ 𝑌} ∪
𝑌 ∪ {𝑛 − 2} 𝑖𝑓 𝑛 − 4 ∈ 𝑌} ,
2
Where 𝑋 ∈ 𝐷𝑐𝑣𝑒 𝑃𝑛−1 , 𝑖 − 1 andY∈ 𝐷 (𝑃 , 𝑖 − 1).
Proof
1. For every n ≥ 3, 𝐷 (𝑃 , 𝑛 − 1)= {3,4,5,6, … . }.
2. Since 𝐷 (𝑃 , 𝑖 − 1) = 𝜑, 𝐷 (𝑃 , 𝑖 − 1)= 𝜑 and 𝐷 (𝑃 , 𝑖 − 1) ≠ 𝜑 , by
lemma 2.6 ( 2), 𝑖 = 𝑛.
Therefore, 𝐷 (𝑃 , 𝑖) = 𝐷 (𝑃 , 𝑛)= {[𝑛]}
3. If 𝐷 (𝑃 , 𝑖 − 1) ≠ 𝜑, 𝐷 (𝑃 , 𝑖 − 1) ≠ 𝜑 and 𝐷 (𝑃 , 𝑖 − 1) = 𝜑 , then by
lemma 2.5, 𝑖 = 𝑛 − 1.
Therefore, 𝐷 (𝑃 , 𝑖) = 𝐷 (𝑃 , 𝑛 − 1)={[𝑛] − {𝑥}/𝑥 ∈ [𝑛]}.
4. The construction of 𝐷 (𝑃 , 𝑖) from 𝐷 (𝑃 , 𝑖 − 1) and 𝐷 (𝑃 , 𝑖 − 1) is as
follows:
Let 𝑋 be a connected vertex edge dominating set of 𝑃 with cardinality 𝑖 − 1.
All the elements of 𝐷 (𝑃 , 𝑖 − 1) ends with 𝑛 − 1 or 𝑛 − 2 or 𝑛 − 3or 𝑛 − 4.
Therefore, when𝑛 − 1 ∈ 𝑋 adjoin n with X and when 𝑛 − 2 ∈ 𝑋 adjoin 𝑛 − 1
with 𝑋 And when 𝑛 − 3 ∈ 𝑋 adjoin 𝑛 − 2 with X and when 𝑛 − 4 ∈ 𝑋 adjoin n 3 with 𝑋.
Hence every 𝑋 of 𝐷 (𝑃 , 𝑖 − 1) belongs to 𝐷 (𝑃 , 𝑖) by adjoining {𝑛} or { 𝑛 − 1} or
{𝑛 − 2} or { 𝑛 − 3} only.
Now let us consider 𝐷 (𝑃 , 𝑖 − 1). Here all the elements of 𝐷 (𝑃 , 𝑖 − 1)
ends with { 𝑛 − 2} or { 𝑛 − 3} or { 𝑛 − 4}. Let 𝑌 be the connected vertex - edge dominating set
of 𝑃 with cardinality𝑖 − 1.Therefore, when 𝑛 − 2𝑌 adjoin 𝑛 with 𝑌 and when 𝑛 − 3 ∈ 𝑌
adjoin 𝑛 − 1 with 𝑌 and when 𝑛 − 4𝑌 adjoin 𝑛 − 2 with 𝑌.
Hence, every 𝑌 of 𝐷 (𝑃 , 𝑖 − 1) belongs to 𝐷 (𝑃 , 𝑖) by adjoining {𝑛} or {𝑛 −
1} or {𝑛 − 2} only.
Hence, we cover all the elements of 𝐷 (𝑃 , 𝑖) by means of elements of
𝐷 (𝑃 , 𝑖 − 1)and 𝐷 (𝑃 , 𝑖 − 1).
Conversely, Suppose 𝑍 ∈ 𝐷 (𝑃 , 𝑖). Here all the elements of 𝐷 (𝑃 , 𝑖) ends
with 𝑛 or 𝑛 − 1 or 𝑛 − 2 or 𝑛 − 3.

Volume 9, Issue 10, October 2020 20 http://adalyajournal.com/

ADALYA JOURNAL https://doi.org/10.37896/aj9.10/003 ISSN NO: 1301-2746

Suppose 𝑛 ∈ 𝑍, then 𝑍= 𝑋𝑈{𝑛}, Where 𝑋 ∈ 𝐷 (𝑃 , 𝑖 − 1) and 𝑋 ends with

𝑛 − 1 or 𝑍 = 𝑌𝑈{𝑛}, where𝑌 ∈ 𝐷 (𝑃 , 𝑖 − 1) and 𝑌 ends with 𝑛 − 2.
Suppose 𝑛 − 1 ∈ 𝑍, then Z = 𝑋𝑈{𝑛 − 1},where𝑋 ∈ 𝐷 (𝑃 , 𝑖 − 1) and 𝑋 ends
with 𝑛 − 2 or Z = 𝑌𝑈{𝑛 − 1} where 𝑌 ∈ 𝐷 (𝑃 , 𝑖 − 1) and Y ends with 𝑛 − 3.
Suppose 𝑛 − 2 ∈ 𝑍 then 𝑍 = 𝑋 ∪ { 𝑛 − 2}, where 𝑋 ∈ 𝐷 𝑃 , 𝑖 − 1 and 𝑋
ends with 𝑛 − 3 or Z = 𝑌 ∪ { 𝑛 − 2} where 𝑌 ∈ 𝐷 𝑃 ,𝑖 − 1 and 𝑌 ends with 𝑛 − 4.

Theorem :2.8
If 𝐷 (𝑃 , 𝑖) is the family of the connected vertex- edge dominating sets of 𝑃
with cardinality 𝑖, where 𝑖 ≥ , then
𝑑 (𝑃 , 𝑖 ) = 𝑑 (𝑃 , 𝑖 − 1) + 𝑑 (𝑃 , 𝑖 − 1).
Proof:
From theorem, 2.7, we consider all the three cases as given below, where 𝑖 ≥ .
Suppose𝐷 (𝑃 , 𝑖 − 1) = 𝜑and 𝐷 (𝑃 , 𝑖 − 1) = 𝜑 , then obviously
𝐷 (𝑃 , 𝑖) = 𝜑 .In this case, |𝐷 (𝑃 , 𝑖 − 1)| = 0 and |𝐷 (𝑃 , 𝑖 − 1)| = 0
Therefore, |𝐷 (𝑃 , 𝑖)| = 0. Therefore, 𝑑 (𝑃 , 𝑖) = 𝑑 (𝑃 , 𝑖 − 1) +
𝑑 (𝑃 , 𝑖 − 1) holds.
Suppose𝐷 (𝑃 , 𝑖 − 1) ≠ 𝜑and 𝐷 (𝑃 , 𝑖 − 1) = 𝜑 , then 𝐷 (𝑃 , 𝑖) =
{𝑛} ∪ 𝑋/𝑋 ∈ 𝐷 (𝑃 , 𝑖 − 1) .
In this case |𝐷 (𝑃 , 𝑖 − 1)| = 1 and |𝐷 (𝑃 , 𝑖 − 1)| = 0.
Therefore, |𝐷 (𝑃 , 𝑖)|= 1+ 0 = 1,
Therefore, 𝑑 (𝑃 , 𝑖) = 𝑑 (𝑃 , 𝑖 − 1) + 𝑑 (𝑃 , 𝑖 − 1) holds.
Suppose𝐷 (𝑃 , 𝑖 − 1) ≠ 𝜑and 𝐷 (𝑃 , 𝑖 − 1) ≠ 𝜑 , then by theorem
2.7(iii),
𝐷 (𝑃 , 𝑖) = {𝑋 ∪ {𝑛} if 𝑛 − 1 ∈ 𝑋} ∪ {𝑋 ∪ {𝑛 − 1} if 𝑛 − 2 ∈ 𝑋} ∪
{𝑋 ∪ {𝑛 − 2}if 𝑛 − 3 ∈ 𝑋} ∪ {𝑋 ∪ {𝑛 − 3}if 𝑛 − 4 ∈ 𝑋} ∪
{𝑌 ∪ {𝑛}if 𝑛 − 2 ∈ 𝑌} ∪ {𝑌 ∪ {𝑛 − 1} if 𝑛 − 3 ∈ 𝑌} ∪
𝑌 ∪ {𝑛 − 2}if 𝑛 − 4 ∈ 𝑌}
where𝑋 ∈ 𝐷 (𝑃 , 𝑖 − 1) and 𝑌 ∈ 𝐷 (𝑃 , 𝑖 − 1)
From the above construction in each case, we obtain that,
𝑑 (𝑃 , 𝑖) = 𝑑 (𝑃 , 𝑖 − 1) + 𝑑 (𝑃 , 𝑖 − 1)

Volume 9, Issue 10, October 2020 21 http://adalyajournal.com/

ADALYA JOURNAL https://doi.org/10.37896/aj9.10/003 ISSN NO: 1301-2746

III. CONNECTED VERTEX - EDGE DOMINATION POLYNOMIAL OF SQUARE

OF PATHS.
Definition 3.1
Let 𝐷 (𝑃 , 𝑖) be the family of connected vertex - edge dominating sets of 𝑃
with cardinality i and let 𝑑 (𝑃 , 𝑖)= |𝐷 (𝑃 , 𝑖)|.
Then the connected vertes- edge domination polynomial 𝐷 (𝑃 , 𝑥 )of 𝑃 is
defined by 𝐷 (𝑃 , 𝑥 ) =∑ 𝑑 (𝑃 , 𝑖)𝑥 .
Theorem : 3.2
For every 𝑛 ≥ 10,
𝐷 (𝑃 , 𝑥 ) = 𝑥[𝐷 (𝑃 , 𝑥 ) + 𝐷 (𝑃 , 𝑥)] with initial values
𝐷 (𝑃 , 𝑥 ) = 𝑥
𝐷 (𝑃 , 𝑥 ) = 𝑥 + 3𝑥
𝐷 (𝑃 , 𝑥 ) = 𝑥 + 4𝑥 + 5𝑥
𝐷 (𝑃 , 𝑥 ) = 𝑥 + 5𝑥 + 8𝑥 +7𝑥
𝐷 (𝑃 , 𝑥 ) = 𝑥 + 6𝑥 + 12𝑥 +12𝑥 +7𝑥
𝐷 (𝑃 , 𝑥 ) = 𝑥 + 7𝑥 + 17𝑥 +20𝑥 +14𝑥 +5𝑥
𝐷 (𝑃 , 𝑥 ) = 𝑥 + 8𝑥 + 23𝑥 +32𝑥 +26𝑥 +12𝑥 + 3𝑥
𝐷 (𝑃 , 𝑥 ) = 𝑥 + 9𝑥 + 30𝑥 +49𝑥 +46𝑥 +26𝑥 + 8𝑥 + 𝑥 .
Proof
We have, 𝑑 (𝑃 , 𝑖) = 𝑑 (𝑃 , 𝑖 − 1)+𝑑 (𝑃 , 𝑖 − 1)
Therefore, 𝑑 (𝑃 , 𝑖)𝑥 = 𝑑 (𝑃 , 𝑖 − 1)𝑥 + 𝑑 (𝑃 , 𝑖 − 1)𝑥 .
∑ 𝑑 (𝑃 , 𝑖)𝑥 = ∑ 𝑑 (𝑃 , 𝑖 − 1)𝑥 + ∑ 𝑑 (𝑃 , 𝑖 − 1)𝑥 .
∑ 𝑑 (𝑃 , 𝑖)𝑥 = 𝑥 ∑ 𝑑 (𝑃 , 𝑖 − 1)𝑥 + 𝑥 ∑ 𝑑 (𝑃 , 𝑖 − 1)𝑥 .
𝐷 (𝑃 , 𝑥 ) = 𝑥 𝐷 (𝑃 , 𝑥 ) + 𝑥 𝐷 (𝑃 , 𝑥 ).
𝐷 (𝑃 , 𝑥) = 𝑥[ 𝐷 (𝑃 , 𝑥) + 𝐷 (𝑃 , 𝑥 )]with initial values
𝐷 𝑃,𝑥 =𝑥
𝐷 (𝑃 , 𝑥 ) = 𝑥 + 3𝑥
𝐷 (𝑃 , 𝑥 ) = 𝑥 + 4𝑥 + 5𝑥
𝐷 (𝑃 , 𝑥 ) = 𝑥 + 5𝑥 + 8𝑥 +7𝑥
𝐷 (𝑃 , 𝑥 ) = 𝑥 + 6𝑥 + 12𝑥 +12𝑥 +7𝑥
𝐷 (𝑃 , 𝑥 ) = 𝑥 + 7𝑥 + 17𝑥 +20𝑥 +14𝑥 +5𝑥
𝐷 (𝑃 , 𝑥 ) = 𝑥 + 8𝑥 + 23𝑥 +32𝑥 +26𝑥 +12𝑥 + 3𝑥
𝐷 (𝑃 , 𝑥 ) =𝑥 + 9𝑥 + 30𝑥 +49𝑥 +46𝑥 +26𝑥 + 8𝑥 + 𝑥 .
We obtain 𝑑 (𝑃 , 𝑖) for 2 ≤ 𝑖 ≤ 15 as shown in Table 1.

Volume 9, Issue 10, October 2020 22 http://adalyajournal.com/

ADALYA JOURNAL https://doi.org/10.37896/aj9.10/003 ISSN NO: 1301-2746

Table 1
𝑑 (𝑃 , 𝑖),the number of connected vertex - edge dominating sets of𝑃 with cardinality 𝑖.

𝑖 2 3 4 5 6 7 8 9 10 11 12 13 14 15
𝑛
2 1

3 3 1

4 5 4 1

5 7 8 5 1

6 7 12 12 6 1

7 5 14 20 17 7 1 1

8 3 12 26 32 23 8 1 15 1

9 1 8 26 46 49 30 9 1

10 0 4 20 52 78 72 38 10 1

11 0 1 12 46 98 127 102 47 11 1

12 0 0 5 32 98 176 199 140 57 12 1

13 0 0 1 17 78 196 303 301 187 68 13 1

14 0 0 0 6 49 176 372 502 441 244 80 14 1

15 0 0 0 1 23 127 372 675 803 628 312 93 15 1

Theorem : 3.3
The following properties hold for the coefficients of 𝐷 (𝑃 , 𝑥)
1. 𝑑 (𝑃 , 𝑛) = 1 , for every 𝑛 ≥ 2.
2. 𝑑 (𝑃 , 𝑛 − 1) = 𝑛, for every 𝑛 ≥ 3.
3. 𝑑 (𝑃 , 𝑛 − 2) = (𝑛 − 3𝑛 + 6), for every 𝑛 ≥ 4.
4. 𝑑 (𝑃 , 𝑛 − 3) = (𝑛 − 9𝑛 + 38𝑛 − 48), for every 𝑛 ≥ 5
5. 𝑑 (𝑃 , 𝑛 − 2) = 1 for every 𝑛 ≥ 4.
6. 𝑑 (𝑃 , 𝑛 − 2) = 𝑛 − 1, for every 𝑛 ≥ 4.
Proof :
1. Since 𝐷 (𝑃 , 𝑛)= {[𝑛]}, we have the result.
2. Since 𝑑 (𝑃 , 𝑛 − 1)= {[𝑛] − {𝑥}/𝑥 ∈ [𝑛] }, we have 𝑑 (𝑃 , 𝑛 − 1) = 𝑛.
3. To prove, 𝑑 (𝑃 , 𝑛 − 2) = (𝑛 − 3𝑛 + 6), for every 𝑛 ≥ 4, we apply induction on n.
When 𝑛 = 4,
L.H.S = 𝑑 (𝑃 , 2) = 5( from the table ) and
R.H.S = (4 − 3 × 4 + 6) = 5
Therefore, the result if true for 𝑛 = 4
Assume the result is true for all numbers less than ‘n’ and we prove it for n.
By theorem 3.2 and theorem 3.3 ( 2), we have,

Volume 9, Issue 10, October 2020 23 http://adalyajournal.com/

ADALYA JOURNAL https://doi.org/10.37896/aj9.10/003 ISSN NO: 1301-2746

𝑑 (𝑃 , 𝑛 − 2) =𝑑 (𝑃 , 𝑛 − 3) + 𝑑 (𝑃 , 𝑛 − 3)
= [(𝑛 − 1) − 3( 𝑛 − 1) + 6] + ( 𝑛 − 2)
= [𝑛 − 2𝑛 + 1 − 3𝑛 + 3 + 6 + 2𝑛 − 4]
= [𝑛 − 3𝑛 + 6]
Hence the result is true for all n.
2. To prove, 𝑑 (𝑃 , 𝑛 − 3) = [𝑛 − 9𝑛 + 38𝑛 − 48], for every 𝑛 ≥ 5, we apply
induction on n. when n = 5, L.H.S = 𝑑 (𝑃 , 2) = 7 ( From the table ) and
R.H.S = [5 − 9 × 5 + 38 × 5 − 48] = 7 .
Therefore, the result is true for n = 5.
Now, suppose that the result is true for all numbers less than ‘n’ and we prove it for n.
By theorem 3.2 and theorem 3.3 ( 3), we have
𝑑 (𝑃 , 𝑛 − 3) = 𝑑 (𝑃 , 𝑛 − 4) + 𝑑 (𝑃 , 𝑛 − 4)
= [(𝑛 − 1) − 9(𝑛 − 1) + 38(𝑛 − 1) − 48]
+ [(𝑛 − 2) − 3(𝑛 − 2) + 6].
= [(𝑛 − 3𝑛 + 3𝑛 − 1) − 9(𝑛 − 2𝑛 + 1) + 38𝑛 − 38 − 48]
+ [𝑛 − 4𝑛 + 4 − 3𝑛 + 6 + 6]
= [𝑛 − 3𝑛 + 3𝑛 − 1 − 9𝑛 − 18𝑛 − 9 + 38𝑛 − 38 − 48 +
3𝑛 − 21𝑛 + 48]
= [𝑛 − 9𝑛 + 38𝑛 − 48]
Hence , the result is true for all n.
3. 𝑑 (𝑃 , 𝑛 − 2) = 1for every 𝑛 ≥ 4, is obvious from the table.
4. To prove 𝑑 (𝑃 , 𝑛 − 2) = 𝑛 − 1, for every 𝑛 ≥ 4 , we prove it for induction on 𝑛.
When 𝑛 = 4,
L. H.S = 𝑑 (𝑃 , 2)= 3, ( from the table) and R.H.S = 4-1 = 3.
Now, assume the result is true for all numbers less than ‘ n’ and we prove it for n.
By theorem 3.2, we have
𝑑 (𝑃 , 𝑛 − 2) = 𝑑 (𝑃 , 𝑛 − 3) + 𝑑 (𝑃 , 𝑛 − 3)
= 𝑛 − 2+ 1
= 𝑛 − 1
Therefore, the result is true for all 𝑛 ≥ 4.
Reference
[1] S. Alikani and Y.H. Peng, “ Domination sets and Domination Polynomials of Cycles, “
Global Journal of pure and Applied Mathematics Vol. 4 No.2, 2008.
[2] S. Alikani and Y.H Peng, “ Introductiontio Domination Polynomial of a graph “, ar Xiv :
0905.225[V] [ math .10] 14 May, 2009.
[3] G. Chartrand and P. Zhamg,” Introduction to Graph Theory, “ McGraw- Hill, Boston,
Mass, USA, 2005.
[4] A. Vijayan and T. Anitha Baby” Connected Total Dominating sets and Connected Total
Domination Polynomials of Square of paths”, International Journal of Mathematics Trends
and Technology, Vol. 11, No.1, 2014.

Volume 9, Issue 10, October 2020 24 http://adalyajournal.com/

ADALYA JOURNAL https://doi.org/10.37896/aj9.10/003 ISSN NO: 1301-2746

[5] A. Vijayan and T. Nagarajan“ Vertex -Edge Dominating Sets and Vertex - Edge
domination polynomials of Paths” International Journal of Mathematics Trends and
Technology, Vol 4(11) : 266-279.
[6] A Vijayan and T. Nagarajan, “ Vertex-Edge Dominating sets and vertex - edge Domination
Polynomials of Wheels”, IOSR Journal of Mathematics , Volume 10, Issue 5 Ver. VI ( Sep
- Oct. 2014), PP 14-21.
[7] A Vijayan and J SherinBeula , “ Edge - vertex Dominating sets and Edge- Vertex
Domination Polynomials of Cycles, “ Open journal of Discrete Mathematics 2015,5, 74-87.

Volume 9, Issue 10, October 2020 25 http://adalyajournal.com/