Monophonic cover pebbling number $(MCPN)$ of network graphs

Lourdusamy, A.; Iammal, S. Kither; Dhivviyanandam, I.

doi:10.61091/um121-02

Abstract

1. Introduction
2. MCPN of families of network graphs

References

Utilitas Mathematica

Volume 121
Pages: 11-24

Research article

Monophonic cover pebbling number $(M C P N)$ of network graphs

^¹, ^², ^³

¹Department of Mathematics, St. Xavier’s College (Autonomous), Palayamkottai-627002, Tamil Nadu, India

²Department of Mathematics, Jayaraj Annapackiam College for women (Autonomous), Periyakulam Tamilnadu, India

³Department of Mathematics, North Bengal st. Xavier’s college, Rajganj, west Bengal, India India

Received: 03/03/2024
Accepted: 20/11/2024
Published: 31/12/2024

Copyright Link
License

Abstract

Given a connected graph $G$ and a configuration $D$ of pebbles on the vertices of $G$ , a pebbling transformation involves removing two pebbles from one vertex and placing one pebble on its adjacent vertex. A monophonic path is defined as a chordless path between two non-adjacent vertices $u$ and $v$ . The monophonic cover pebbling number, $γ_{μ} (G)$ , is the minimum number of pebbles required to ensure that, after a series of pebbling transformations using monophonic paths, all vertices of $G$ are covered with at least one pebble each. In this paper, we determine the monophonic cover pebbling number ( $M C P N$ ) for the gear graph, sunflower planar graph, sun graph, closed sun graph, tadpole graph, lollipop graph, double star-path graph, and a class of fuses.

Keywords: Gear graph, sun graph, Closed sun graph, Sunflower planer graph, Tadpole graph, Lollipop graph, Double star-path graph, Monophonic pebbling, Monophonic cover pebbling

1. Introduction

A pebbling move is defined as the removal of two pebbles from one vertex, followed by the placement of one pebble on an adjacent vertex, while the other pebble is eliminated. The pebbling number of a vertex $v$ in a graph $G$ is the smallest positive integer $f (G, v)$ such that, for every distribution of $f (G, v)$ pebbles on the vertices of $G$ , one pebble can be moved to $v$ through a sequence of pebbling moves. The pebbling number $f (G)$ is the maximum of $f (G, v)$ over all vertices of $G$ . For more information on graph pebbling, interested readers can refer to [5].

The pebbling problem focuses on ensuring that one pebble can reach any specified target vertex. This problem can be interpreted as the transmission of information from one specific location to a target location. However, a natural question arises: how can information reach all locations of a graph simultaneously within a reasonable time? In pebbling terminology, this requires placing one pebble on all the vertices of the graph $G$ simultaneously. For example, in an Adhoc Network, if there is congestion in the network, the information must reach neighboring locations immediately. This question is addressed by a variation of pebbling, called the cover pebbling number.

The cover pebbling number of a graph $γ (G)$ is the minimum number of pebbles required such that, for any configuration of $γ (G)$ pebbles on the vertices of $G$ , each vertex will have at least one pebble after a series of pebbling moves. At the end of this process, no vertex is left uncovered. Crull et al. [3] introduced the concept of cover pebbling, determining the cover pebbling number for complete graphs, paths, and trees. In [6], Hulbert and Munyan determined the cover pebbling number of the $d$ -cube. Later, in 2010, Subido and Aniversario [10] expanded upon the work of Crull et al. by determining the cover pebbling number of graphs via a key vertex. Furthermore, Vuong and Wyckoff [11] introduced the stacking conjecture, where all pebbles for cover pebbling are placed on a single vertex. For any connected graph $G$ , by the stacking theorem, $γ (G) = \sum_{u \in V (G)} 2^{dist (u, v)}$ . Any vertex $v$ satisfying this equation is a key vertex of the graph. Selecting a suitable key vertex is particularly challenging for random graphs, graphs with a large number of vertices, and graphs with varying diameters. Specifically, the intuition of obtaining the cover pebbling number of graphs by distributing pebbles over the vertices of $G$ is equivalent to finding the cover pebbling number by stacking all the pebbles at a suitable key vertex.

Santhakumaran et al. [9] introduced the concept of monophonic distance in graphs. The monophonic distance between $u$ and $v$ , denoted as $d_{m} (u, v)$ , is the length of the longest $u$ – $v$ monophonic path in $G$ . For any two vertices $u$ and $v$ in a connected graph $G$ , a $u$ – $v$ path is a monophonic path if it contains no chords [9]. (A chord is a line segment connecting two points on a curve.) Lourdusamy et al. [7] defined the monophonic pebbling number using monophonic paths. The monophonic pebbling number, $μ (G)$ , of a connected graph $G$ , is the smallest positive integer $n$ such that any distribution of $n$ pebbles on $G$ allows one pebble to be moved to any specified vertex using monophonic paths via a sequence of pebbling moves.

Building on these definitions, we introduce the concept of a monophonic cover pebbling number. The monophonic cover pebbling number, $γ_{μ} (G)$ , is the minimum number of pebbles required to cover all the vertices of $G$ with at least one pebble on each vertex after a series of pebbling transformations using monophonic paths. While the pebbling number of a graph is determined using the shortest distance in a graph $G$ , the monophonic pebbling number is determined using monophonic distance. These two concepts play a crucial role in applications such as the supply of goods and transportation problems. When geodesic paths are unavailable, monophonic paths can serve as alternatives. The choice of paths directly impacts the cost of goods. Similarly, these concepts are applicable in network information transmission from one node to another. The monophonic cover pebbling number ensures the equitable distribution of goods across all customers using monophonic paths. For basic terminologies in graph theory, readers can refer to [1] and [2].

In this paper, we determine the monophonic cover pebbling number for various graphs, including the gear graph, sunflower planar graph, sun graph, closed sun graph, tadpole graph, lollipop graph, double star-path graph, and a class of fuses.

Notation 1.1.

The notation $G_{n}$ stands for the gear graph, which is taken from [4]. The notation $S f_{n}$ stands for the sunflower planar graph, also taken from [4]. The notation $S_{u}$ stands for the sun graph, and $\bar{S_{u}}$ stands for the closed sun graph, both referenced in [4]. The notation $T_{m, n}$ stands for the $(m, n)$ tadpole graph, which is taken from [12].

Theorem 1.2. [8] For the path $P_{n}$ , $γ_{μ} (P_{n})$ is $2^{n} - 1$ .

Definition 1.3.

[10] Let $v \in V (G)$ . Then $v$ is called a key or source vertex if $dist (v)$ is maximum.

Notation 1.4.

Throughout this article, we denote:

$β$ as the source vertex.
$M_{i}$ as the monophonic path, and $M_{i}^{\sim}$ contains the vertices that are not on $M_{i}$ .
$M C P N$ as the monophonic cover pebbling number.
$d_{m}$ as the monophonic distance.
$N (v_{0})$ as the neighborhood of $v_{0}$ .

2. $M C P N$ of families of network graphs

Theorem 2.1.

For the gear graph $G_{n}$ , $γ_{μ} (G_{n})$ is $2 (\sum_{k = n + 1}^{2 (n - 1)} 2^{k}) + 2^{n} + 9$ .

Proof. Let $V (G_{n}) = {u_{0}, u_{1}, u_{2}, \dots, u_{n}, v_{1}, v_{2}, \dots, v_{n}}$ and $E (G_{n}) = {u_{i} v_{i}, v_{j} u_{j + 1}, v_{n} u_{1}, u_{0} u_{i}}$ , where $1 \leq i \leq n$ and $1 \leq j \leq n - 1$ . Without loss of generality, let $n$ be odd. Let $p (v_{1}) = 2 (\sum_{k = n + 1}^{2 (n - 1)} 2^{k}) + 2^{n} + 8$ . To cover the vertices $v_{2}, u_{3}, v_{3}, \dots, u_{⌈ \frac{n}{2} ⌉}, v_{⌈ \frac{n}{2} ⌉}, v_{⌈ \frac{n}{2} ⌉ + 1}, u_{⌈ \frac{n}{2} ⌉ + 2}, \dots, v_{n},$ it will cost $2 (2^{n + 1} + 2^{n + 2} + \dots + 2^{2 (n - 1)})$ pebbles; to cover $u_{⌈ \frac{n}{2} ⌉ + 1}$ it will cost $2^{n}$ pebbles; to cover $N (v_{1})$ it will cost $4$ pebbles; to cover $u_{0}$ it will cost $4$ pebbles, and there is no pebble left to cover $v_{1}$ . Thus, $γ_{μ} (G_{n}) \geq 2 (\sum_{k = n + 1}^{2 (n - 1)} 2^{k}) + 2^{n} + 9.$

Now we prove $γ_{μ} (G_{n}) \leq 2 (\sum_{k = n + 1}^{2 (n - 1)} 2^{k}) + 2^{n} + 9$ .

Case 1: Let $β = v_{1}$ .

From Table 1, to cover the vertices $v_{2}, u_{3}, v_{3}, \dots, u_{⌈ \frac{n}{2} ⌉}, v_{⌈ \frac{n}{2} ⌉}, v_{⌈ \frac{n}{2} ⌉ + 1}, u_{⌈ \frac{n}{2} ⌉ + 2}, \dots, v_{n}$ , we require $2 (2^{n + 1} + 2^{n + 2} + \dots + 2^{2 (n - 1)})$ pebbles; to cover $u_{⌈ \frac{n}{2} ⌉ + 1}$ we require $2^{n}$ pebbles; to cover $N (v_{1})$ we need $4$ pebbles; to cover $u_{0}$ we need $4$ pebbles, and to cover $v_{1}$ we need $1$ pebble. Thus, in this case, we use $γ_{μ} (G_{n}) = 2 (\sum_{k = n + 1}^{2 (n - 1)} 2^{k}) + 2^{n} + 9$ pebbles.

Table 1 Monophonic distance from $v_{1}$ , $u_{1}$ , $u_{0}$ to $V (G_{n})$
	$u_{1}$	$v_{1}$	$u_{2}$	$v_{2}$	$u_{3}$	$v_{3}$	$\dots$	$u_{⌈} \frac{n}{2} ⌉$	$v_{⌈} \frac{n}{2} ⌉$	$u_{⌈} \frac{n}{2} ⌉ + 1$	$v_{⌈} \frac{n}{2} ⌉ + 1$	$\dots$	$u_{n}$	$v_{n}$	$u_{0}$
$v_{1}$	$1$	$0$	$1$	$2 n - 2$	$2 n - 3$	$2 n - 4$	$\dots$	$n + 2$	$n + 1$	$n$	$n + 1$	$\dots$	$2 n - 3$	$2 n - 2$	$2$
$u_{1}$	$0$	$1$	$2 n - 2$	$2 n - 3$	$2 n - 4$	$2 n - 5$	$\dots$	$n + 1$	$n$	$n + 1$	$n + 2$	$\dots$	$2 n - 2$	$1$	$1$
$u_{0}$	$1$	$2$	$1$	$2$	$1$	$2$	$\dots$	$1$	$2$	$1$	$2$	$\dots$	$1$	$2$	$0$

Case 2: Let $β = u_{1}$ .

From Table 1, to cover the vertices $v_{2}, u_{3}, v_{3}, \dots, u_{⌈ \frac{n}{2} ⌉}, v_{⌈ \frac{n}{2} ⌉}, u_{⌈ \frac{n}{2} ⌉ + 1}, u_{⌈ \frac{n}{2} ⌉ + 2}, \dots, v_{n}$ , we need $2 (2^{n + 1} + 2^{n + 2} + \dots + 2^{2 (n - 1)})$ pebbles; to cover $v_{⌈ \frac{n}{2} ⌉}$ we require $2^{n}$ pebbles; to cover $N (v_{1})$ we need $6$ pebbles; to cover $u_{1}$ we need $1$ pebble. Thus, in this case, we use $γ_{μ} (G_{n}) = 2 (\sum_{k = n + 1}^{2 (n - 1)} 2^{k}) + 2^{n} + 7$ pebbles.

Case 3: Let $β = u_{0}$ .

From Table 1, to cover the vertices $u_{1}, u_{2}, \dots, u_{n}$ , we need $2 n$ pebbles; to cover $v_{1}, v_{2}, \dots, v_{n}$ , we need $4 n$ pebbles; to cover $u_{0}$ , we need $1$ pebble. Thus, here we use $γ_{μ} (G_{n}) = 6 n + 1$ pebbles.

Theorem 2.2.

The $M C P N$ of the sunflower planar graph $S f_{n}$ is: $γ_{μ} (S f_{n}) = {\begin{cases} 4 (\sum_{i = \frac{n}{2} + 2}^{n - 1} 2^{i}) + 3 (2^{\frac{n}{2} + 1}) + 2^{n + 1} + 9, & if n iseven, \\ 4 (\sum_{i = ⌈ \frac{n}{2} ⌉ + 1}^{n - 1} 2^{i}) + 2^{⌈ \frac{n}{2} ⌉} + 2^{n + 1} + 9, & if n is odd . \end{cases}$

Proof. Let $V (S f_{n}) = {u_{0}, u_{1}, \dots, u_{n}, v_{1}, v_{2}, \dots, v_{n}}$ and $E (S f_{n}) = {u_{0} u_{i}, u_{j} u_{j + 1}, u_{1} u_{n}, u_{i} v_{i}, u_{j + 1} v_{j}, u_{1} v_{n}},$ where $i = 1, 2, \dots, n$ and $j = 1, 2, \dots, n - 1$ . The center vertex $u_{0}$ has degree $n$ , vertices $u_{1}, u_{2}, \dots, u_{n}$ have degree 5, and vertices $v_{1}, v_{2}, \dots, v_{n}$ have degree 2.

Case 1: When $n$ is even.

Table 2 Monophonic distance from $v_{1}$ , $u_{1}$ , $u_{0}$ to $V (S f_{n})$ (even $n$ )
	$u_{1}$	$v_{1}$	$u_{2}$	$v_{2}$	$u_{3}$	$v_{3}$	$\dots$	$u_{\frac{n}{2}}$	$v_{\frac{n}{2}}$	$u_{\frac{n}{2}} + 1$	$v_{\frac{n}{2}} + 1$	$u_{\frac{n}{2}} + 2$	$\dots$	$v_{n} - 1$	$u_{n}$	$v_{n}$	$u_{0}$
$v_{1}$	$1$	$0$	$1$	$n$	$n - 1$	$n - 1$	$\dots$	$\frac{n}{2} + 2$	$\frac{n}{2} + 2$	$\frac{n}{2} + 1$	$\frac{n}{2} + 1$	$\frac{n}{2} + 1$	$\dots$	$n - 1$	$n - 1$	$n$	$2$
$u_{1}$	$0$	$1$	$1$	$n - 1$	$n - 2$	$n - 2$	$\dots$	$\frac{n}{2} + 1$	$\frac{n}{2} + 1$	$\frac{n}{2}$	$\frac{n}{2} + 1$	$\frac{n}{2} + 1$	$\dots$	$n - 1$	$1$	$1$	$1$
$u_{0}$	$1$	$2$	$1$	$2$	$1$	$2$	$\dots$	$1$	$2$	$1$	$2$	$1$	$\dots$	$2$	$1$	$2$	$0$

Subcase 1.1: $β = u_{1}$ .

From Table 2, to cover $v_{2}, v_{n - 1}$ it will cost $2 (2^{n - 1})$ pebbles; to cover $u_{3}, v_{3}, \dots, u_{\frac{n}{2}}, v_{\frac{n}{2}}, v_{\frac{n}{2} + 1}, u_{\frac{n}{2} + 2}, \dots, v_{n - 2}, u_{n - 1},$ it will cost $4 (\sum_{j = \frac{n}{2} + 1}^{n - 2} 2^{j})$ pebbles; to cover $u_{\frac{n}{2} + 1}$ it will cost $2^{\frac{n}{2}}$ pebbles; to cover $N (u_{1})$ it will cost $10$ pebbles; to cover $u_{1}$ it will cost $1$ pebble. Thus, in this case to cover all the vertices we used $4 (\sum_{j = \frac{n}{2} + 1}^{n - 2} 2^{j}) + 2^{n} + 2^{\frac{n}{2}} + 11.$

Subcase 1.2: $β = v_{1}$ .

From Table 2, to cover $v_{2}$ and $v_{n}$ it requires $2^{n + 1}$ pebbles; to cover $u_{3}, v_{3}, \dots, u_{\frac{n}{2}}, v_{\frac{n}{2}}, v_{\frac{n}{2} + 2}, u_{\frac{n}{2} + 3}, \dots, v_{n - 1}, u_{n},$ it requires $4 (\sum_{i = \frac{n}{2} + 2}^{n - 1} 2^{i})$ pebbles; to cover $u_{\frac{n}{2} + 1}, v_{\frac{n}{2} + 1}, u_{\frac{n}{2} + 2}$ , it requires $3 (2^{\frac{n}{2} + 1})$ pebbles; to cover $u_{1}$ and $u_{2}$ , it requires $4$ pebbles; to cover $u_{0}$ , it requires $4$ pebbles; to cover $v_{1}$ , it requires $1$ pebble. Thus, in this case we used $4 (\sum_{i = \frac{n}{2} + 2}^{n - 1} 2^{i}) + 3 (2^{\frac{n}{2} + 1}) + 2^{n + 1} + 9.$

Subcase 1.3: $β = u_{0}$ .

From Table 2, to cover $N (u_{0})$ it will cost $2 n$ pebbles; to cover $v_{1}, v_{2}, \dots, v_{n}$ it will cost $4 n$ pebbles; to cover $u_{0}$ it will cost $1$ pebble. Thus, in this case we used $6 n + 1.$

Case 2: When $n$ is odd.

Table 3 Monophonic distance from $v_{1}, u_{1}, u_{0}$ to $V (S f_{n})$ (odd n)
	$u_{1}$	$v_{1}$	$u_{2}$	$v_{2}$	$u_{3}$	$v_{3}$	$\dots$	$u_{⌈} \frac{n}{2} ⌉$	$v_{⌈} \frac{n}{2} ⌉$	$u_{⌈} \frac{n}{2} ⌉ + 1$	$\dots$	$v_{n} - 1$	$u_{n}$	$v_{n}$	$u_{0}$
$v_{1}$	$1$	$0$	$1$	$n$	$n - 1$	$n - 1$	$\dots$	$⌈ \frac{n}{2} ⌉$	$⌈ \frac{n}{2} ⌉$	$⌈ \frac{n}{2} ⌉$	$\dots$	$n - 1$	$n - 1$	$n$	$1$
$u_{1}$	$0$	$1$	$1$	$n - 1$	$n - 2$	$n - 2$	$\dots$	$⌈ \frac{n}{2} ⌉$	$⌈ \frac{n}{2} ⌉$	$⌈ \frac{n}{2} ⌉ + 1$	$\dots$	$n - 1$	$1$	$1$	$1$
$u_{0}$	$1$	$2$	$1$	$2$	$1$	$2$	$\dots$	$1$	$2$	$1$	$\dots$	$2$	$1$	$2$	$0$

Subcase 2.1: $β = u_{1}$ .

From Table 3, to cover $v_{2}, v_{n - 1}$ it will cost $2^{n}$ pebbles; to cover $u_{3}, v_{3}, \dots, v_{⌈ \frac{n}{2} ⌉ - 1}, v_{⌈ \frac{n}{2} ⌉ + 1}, \dots, v_{n - 2}, u_{n - 1}$ it will cost $4 (\sum_{j = ⌈ \frac{n}{2} ⌉ + 1}^{n - 2} 2^{j})$ pebbles; to cover $u_{⌈ \frac{n}{2} ⌉}, v_{⌈ \frac{n}{2} ⌉}, u_{⌈ \frac{n}{2} ⌉ + 1}$ it will cost $3 (2^{⌈ \frac{n}{2} ⌉})$ pebbles; to cover $N (u_{1})$ it will cost $10$ pebbles; to cover $u_{1}$ it will cost $1$ pebble. Thus, in this case we used $4 (\sum_{j = ⌈ \frac{n}{2} ⌉ + 1}^{n - 2} 2^{j}) + 3 (2^{⌈ \frac{n}{2} ⌉}) + 2^{n} + 11$ pebbles.

Subcase 2.2: Let $β = v_{1}$ .

From Table 3, to cover $v_{2}, v_{n}$ it will cost $2^{n + 1}$ pebbles; to cover $u_{3}, v_{3}, \dots, u_{⌈ \frac{n}{2} ⌉}, v_{⌈ \frac{n}{2} ⌉}, v_{⌈ \frac{n}{2} + 1}, u_{⌈ \frac{n}{2} ⌉ + 2}, \dots, v_{n - 1}, u_{n}$ it will cost $4 (\sum_{i = ⌈ \frac{n}{2} ⌉ + 1}^{n - 1} 2^{i})$ pebbles; to cover $u_{\frac{n}{2} + 1}$ it will cost $2^{⌈ \frac{n}{2} ⌉}$ pebbles; to cover $u_{1}, u_{2}$ it will cost $4$ pebbles; to cover $u_{0}$ it will cost $4$ pebbles; to cover $v_{1}$ it will cost $1$ pebble. Thus, in this case we used $4 (\sum_{i = ⌈ \frac{n}{2} ⌉ + 1}^{n - 1} 2^{i}) + 2^{⌈ \frac{n}{2} ⌉} + 2^{n + 1} + 9$ pebbles.

Subcase 2.3: Let $β = u_{0}$ .

From Table 3, to cover $N (u_{0})$ it will cost $2 n$ pebbles; to cover $v_{1}, v_{2}, \dots, v_{n}$ it will cost $4 n$ pebbles; to cover $u_{0}$ it will cost $1$ pebble. Thus, in this case we used $6 n + 1$ pebbles.

For the Sun graph $S_{u}$ , $γ_{μ} (S_{u}) = 12 u - 11.$

Proof. Let $V (S_{u}) = {y_{1}, y_{2}, \dots, y_{u}, x_{1}, x_{2}, \dots, x_{u}}$ and $E (S_{u}) = {y_{i} y_{i + 1}, y_{1} y_{u}, y_{i} x_{i}, x_{i} y_{i + 1}, y_{u} x_{u}, x_{u} y_{1}, y_{i} v_{j}}$ where $1 \leq i, j \leq u - 1$ and $i \neq j$ . The degree of $x_{i}$ is $u + 1$ and $y_{i}$ is $2$ . Let $p (x_{1}) = 5 u - 12.$ To cover the vertices $x_{2}, x_{3}, \dots, x_{u}$ , we require $2^{3} (u - 1)$ pebbles; to cover $y_{3}, y_{4}, \dots, y_{u}$ , we require $2^{2} (u - 2)$ pebbles; to cover $y_{1}, y_{2}$ , we require $4$ pebbles. Now there is no pebble to cover $x_{1}$ . Hence, $γ_{μ} (S_{u}) \geq 12 u - 11.$

Now we show $γ_{μ} (S_{u}) \leq 12 u - 11.$

Table 4 Monophonic distance from $y_{1}$ , $x_{1}$ to $V (S_{u})$
	$y_{1}$	$x_{1}$	$y_{2}$	$x_{2}$	$y_{3}$	$x_{3}$	$\dots$	$y_{u} - 1$	$x_{u} - 1$	$y_{u}$	$x_{u}$
$y_{1}$	$0$	$1$	$1$	$2$	$1$	$2$	$\dots$	$1$	$2$	$1$	$1$
$x_{1}$	$1$	$0$	$1$	$3$	$2$	$3$	$\dots$	$2$	$3$	$2$	$3$

Case 1: Let $β = x_{k}$ where $1 \leq k \leq u$ .

Fix $k = 1$ . From Table 4, to cover the vertices $x_{2}, x_{3}, \dots, x_{u}$ , which are at the monophonic distance $3$ , we require $2^{3} (u - 1)$ pebbles; to cover $y_{3}, y_{4}, \dots, y_{u}$ , which are at the monophonic distance $2$ , we require $2^{2} (u - 2)$ pebbles; to cover $N (x_{1})$ , we require $4$ pebbles; and to cover $x_{1}$ , we require $1$ pebble. Thus, in this case, we used $12 u - 11$ pebbles.

Case 2: Let $β = y_{k}$ where $1 \leq k \leq u$ .

Fix $k = 1$ . From Table 4, to cover the vertices $x_{2}, x_{3}, \dots, x_{u - 1}$ , which are at the monophonic distance $2$ , we require $2^{2} (u - 2)$ pebbles; to cover $y_{2}, y_{3}, \dots, y_{u}, x_{1}, x_{u}$ , which are adjacent to $y_{1}$ , we require $2 (u + 1)$ pebbles; to cover $y_{1}$ , we require $1$ pebble. Thus, in this case, we used $4 u - 4 + 2 u + 2 + 1 = 6 u - 1 pebbles.$

Theorem 2.4.

For $\bar{S_{u}}$ , $γ_{μ} (\bar{S_{u}})$ is $γ_{μ} (\bar{S_{u}}) = {\begin{cases} 2 (\sum_{k = \frac{u}{2} + 1}^{u - 1} 2^{k}) + 2 u + 3, & if u is even, \\ 2 (\sum_{k = ⌈ \frac{u}{2} ⌉ + 1}^{u - 1} 2^{k}) + 2^{⌈ \frac{u}{2} ⌉} + 2 u + 3, & if u is odd. \end{cases}$

Proof. Let $V (\bar{S_{u}}) = {y_{1}, \dots, y_{u}, x_{1}, x_{2}, \dots, x_{u}}$ and $E (\bar{S_{u}}) = {y_{i} y_{i + 1}, y_{1} y_{u}, x_{i} x_{i + 1}, x_{1} x_{u}, y_{i} x_{i}, x_{i} y_{i + 1}, y_{u} x_{u}, x_{u} y_{1}, y_{i} y_{j}}$ , where $1 \leq i, j \leq u - 1$ and $i \neq j$ . The degree of $y_{i}$ is $u + 1$ , and the degree of $x_{i}$ is $4$ .

Case 1: When $u$ is even.

Let $p (y_{1}) = 2 (\sum_{k = \frac{u}{2} + 1}^{u - 1} 2^{k}) + 2 u + 2$ . To cover the vertices $x_{1}, y_{2}, y_{3}, \dots, y_{u}, x_{u}$ , it requires $2 u + 2$ pebbles; to cover the vertices $x_{2}, x_{3}, \dots, x_{u - 1}$ , it requires $2 (\sum_{k = \frac{u}{2} + 1}^{u - 1} 2^{k})$ pebbles, and there is no pebble left to cover $y_{1}$ . Thus, $γ_{μ} (\bar{S_{u}}) \geq 2 (\sum_{k = \frac{u}{2} + 1}^{u - 1} 2^{k}) + 2 u + 2.$

Now we show $γ_{μ} (\bar{S_{u}}) \leq 2 (\sum_{k = \frac{u}{2} + 1}^{u - 1} 2^{k}) + 2 u + 2$ .

Table 5 Monophonic distance from $y_{1}$ and $x_{1}$ to $V (\bar{S_{u}})$
	$y_{1}$	$x_{1}$	$y_{2}$	$x_{2}$	$y_{3}$	$x_{3}$	$\dots$	$x_{\frac{u}{2}}$	$y_{\frac{u}{2}} + 1$	$x_{\frac{u}{2}} + 1$	$y_{\frac{u}{2}} + 2$	$x_{\frac{u}{2}} + 2$	$\dots$	$y_{u} - 2$	$x_{u} - 2$	$y_{u} - 1$	$x_{u} - 1$	$y_{u}$	$x_{u}$
$x_{1}$	$1$	$0$	$1$	$1$	$2$	$u - 1$	$\dots$	$\frac{u}{2} + 2$	$2$	$\frac{u}{2} + 1$	$2$	$\frac{u}{2} + 2$	$\dots$	$2$	$u - 2$	$2$	$u - 1$	$2$	$1$
$y_{1}$	$0$	$1$	$1$	$u - 1$	$1$	$u - 2$	$\dots$	$\frac{u}{2} + 1$	$1$	$\frac{u}{2} + 1$	$1$	$\frac{u}{2} + 2$	$\dots$	$1$	$u - 2$	$1$	$u - 1$	$1$	$1$

Subcase 1.1: Let $β = y_{1}$ .

From Table 5, to cover $N (y_{1})$ , it costs $2 u + 2$ pebbles; to cover $x_{2}, x_{3}, \dots, x_{u - 1}$ , which are at monophonic distances $u - 1, u - 2, \dots, \frac{u}{2} + 1$ , it costs $2 (\sum_{k = \frac{u}{2} + 1}^{u - 1} 2^{k})$ pebbles; to cover $y_{1}$ , it costs $1$ pebble. Thus, in this subcase, we used $2 (\sum_{k = \frac{u}{2} + 1}^{u - 1} 2^{k}) + 2 u + 2$ pebbles.

Subcase 1.2: Let $β = x_{1}$ .

From Table 5, to cover $N (x_{1})$ , it costs $8$ pebbles; to cover $y_{3}, y_{4}, \dots, y_{u}$ , it costs $4 u - 8$ pebbles; to cover $x_{3}, x_{4}, \dots, x_{u - 1}$ , which are at monophonic distances $u - 1, u - 2, \dots, \frac{u}{2} + 2$ , it costs $2 (\sum_{k = \frac{u}{2} + 2}^{u - 1} 2^{k}) + 2^{\frac{u}{2} + 1}$ pebbles; to cover $x_{1}$ , it costs $1$ pebble. Thus, in this subcase, we used $2 (\sum_{k = \frac{u}{2} + 2}^{u - 1} 2^{k}) + 2^{\frac{u}{2} + 1} + 4 u + 1 < 2 (\sum_{k = \frac{u}{2} + 1}^{u - 1} 2^{k}) + 2 u + 2.$

Case 2: When $u$ is odd.

Let $p (y_{1}) = 2 (\sum_{k = ⌈ \frac{u}{2} ⌉ + 1}^{u - 1} 2^{k}) + 2^{⌈ \frac{u}{2} ⌉} + 2 u + 2.$ To cover the vertices $x_{1}, y_{2}, y_{3}, \dots, y_{u}, x_{u}$ , it requires $2 u + 2$ pebbles; to cover the vertices $x_{2}, x_{3}, \dots, x_{u - 1}$ , it requires $2 (\sum_{k = ⌈ \frac{u}{2} ⌉ + 1}^{u - 1} 2^{k}) + 2^{⌈ \frac{u}{2} ⌉}$ pebbles, and there is no pebble to cover $y_{1}$ . Thus, $γ_{μ} (\bar{S_{u}}) \geq 2 (\sum_{k = ⌈ \frac{u}{2} ⌉ + 1}^{u - 1} 2^{k}) + 2^{⌈ \frac{u}{2} ⌉} + 2 u + 2.$

Now we prove $γ_{μ} (\bar{S_{u}}) \leq 2 (\sum_{k = ⌈ \frac{u}{2} ⌉ + 1}^{u - 1} 2^{k}) + 2^{⌈ \frac{u}{2} ⌉} + 2 u + 2.$

Table 6 Monophonic distance from $y_{1}$ and $x_{1}$ to $V (\bar{S_{u}})$
	$y_{1}$	$x_{1}$	$y_{2}$	$x_{2}$	$y_{3}$	$x_{3}$	$\dots$	$x_{⌈} \frac{u}{2} ⌉$	$y_{⌈} \frac{u}{2} ⌉ + 1$	$x_{⌈} \frac{u}{2} ⌉ + 1$	$y_{⌈} \frac{u}{2} ⌉ + 2$	$x_{⌈} \frac{u}{2} ⌉ + 2$	$\dots$	$y_{u} - 2$	$x_{u} - 2$	$y_{u} - 1$	$x_{u} - 1$	$y_{u}$	$x_{u}$
$x_{1}$	$1$	$0$	$1$	$1$	$2$	$u - 1$	$\dots$	$⌈ \frac{u}{2} ⌉ + 1$	$2$	$⌈ \frac{u}{2} ⌉ + 1$	$2$	$⌈ \frac{u}{2} ⌉ + 2$	$\dots$	$2$	$u - 2$	$2$	$u - 1$	$2$	$1$
$y_{1}$	$0$	$1$	$1$	$u - 1$	$1$	$u - 2$	$\dots$	$⌈ \frac{u}{2} ⌉$	$1$	$⌈ \frac{u}{2} ⌉ + 1$	$1$	$⌈ \frac{u}{2} ⌉ + 2$	$\dots$	$1$	$u - 2$	$1$	$u - 1$	$1$	$1$

Subcase 2.1: Let $β = y_{1}$ .

From Table 6, to cover $N (y_{1})$ , it will cost $2 u + 2$ pebbles; to cover $x_{2}, x_{3}, \dots, x_{u - 1}$ , which are at the monophonic distances $u - 1, u - 2, \dots, ⌈ \frac{u}{2} ⌉ + 1$ , it will cost $2 (\sum_{k = ⌈ \frac{u}{2} ⌉ + 1}^{u - 1} 2^{k}) + 2^{⌈ \frac{u}{2} ⌉}$ pebbles; to cover $y_{1}$ , it will cost $1$ pebble. Thus, in this case, we used $2 (\sum_{k = ⌈ \frac{u}{2} ⌉ + 1}^{u - 1} 2^{k}) + 2^{⌈ \frac{u}{2} ⌉} + 2 u + 2$ pebbles.

Subcase 2.2: Let $β = x_{1}$ .

From Table 6, to cover $N (x_{1})$ , it will cost $8$ pebbles; to cover $y_{3}, y_{4}, \dots, y_{u}$ , it will cost $4 u - 8$ pebbles; to cover $x_{3}, x_{4}, \dots, x_{u - 1}$ , which are at the monophonic distances $u - 1, u - 2, \dots, ⌈ \frac{u}{2} ⌉ + 2$ , it will cost $2 (\sum_{k = ⌈ \frac{u}{2} ⌉ + 1}^{u - 1} 2^{k})$ pebbles; to cover $x_{1}$ , it will cost $1$ pebble. Thus, in this case, we used $2 (\sum_{k = ⌈ \frac{u}{2} ⌉ + 1}^{u - 1} 2^{k}) + 4 u + 1 < 2 (\sum_{k = ⌈ \frac{u}{2} ⌉ + 1}^{u - 1} 2^{k}) + 2^{⌈ \frac{u}{2} ⌉} + 2 u + 2$ pebbles.

Theorem 2.5.

For $T_{m, n},$ $γ_{μ} (T_{m, n}) = {\begin{cases} 2 (\sum_{k = \frac{m}{2} + n + 1}^{m + n - 2} 2^{k}) + 2^{\frac{m}{2} + n} + 3 (2^{n + 1}) - 1, & if m iseven, \\ 2 (\sum_{k = ⌈ \frac{m}{2} ⌉ + n}^{m + n - 2} 2^{k}) + 3 (2^{n + 1}) - 1, & if m is odd . \end{cases}$

Proof. Let $V (T_{m, n}) = {v_{1}, v_{2}, \dots, v_{m}, u_{1}, u_{2}, \dots, u_{n}}$ and $E (T_{m, n}) = {u_{i} u_{i + 1}, u_{1} v_{1}, v_{k} v_{k + 1}, v_{m} v_{1}}$ where $i = 1, 2, \dots, n - 1$ and $k = 1, 2, \dots, m - 1$ . Consider a bridge between $u_{1}$ and $v_{1}$ .

Case 1: When $m$ is even.

Let $p (u_{n}) = 2 (\sum_{k = \frac{m}{2} + n + 1}^{m + n - 2} 2^{k}) + 2^{\frac{m}{2} + n} + 3 (2^{n + 1}) - 2.$ To cover the vertices $v_{2}, v_{1}, u_{1}, u_{2}, \dots, u_{n}$ we need $2^{n + 2} - 1$ pebbles; to cover $v_{m}$ we need $2^{n + 1}$ pebbles; to cover $v_{2}, v_{3}, \dots, v_{\frac{m}{2}}, v_{\frac{m}{2} + 2}, \dots, v_{m - 1}$ we need $2 (\sum_{k = \frac{m}{2} + n + 1}^{m + n - 2} 2^{k})$ pebbles; to cover $v_{\frac{m}{2} + 1}$ we need $2^{\frac{m}{2} + n}$ pebbles but we have $2^{\frac{m}{2} + n} - 1$ pebbles. Thus, there must be a vertex without cover. Hence, $γ_{μ} (T_{m, n}) \geq 2 (\sum_{k = \frac{m}{2} + n + 1}^{m + n - 2} 2^{k}) + 2^{\frac{m}{2} + n} + 3 (2^{n + 1}) - 1.$ Now we prove $γ_{μ} (T_{m, n}) \leq 2 (\sum_{k = \frac{m}{2} + n + 1}^{m + n - 2} 2^{k}) + 2^{\frac{m}{2} + n} + 3 (2^{n + 1}) - 1.$

Subcase 1.1: Let $β = u_{n}$ .

To cover the vertices $v_{2}, v_{1}, u_{1}, u_{2}, \dots, u_{n}$ , it will cost $2^{n + 2} - 1$ pebbles; to cover $v_{m}$ it will cost $2^{n + 1}$ pebbles; to cover $v_{2}, v_{3}, \dots, v_{\frac{m}{2}}, v_{\frac{m}{2} + 2}, \dots, v_{m - 1}$ it will cost $2 (\sum_{k = \frac{m}{2} + n + 1}^{m + n - 2} 2^{k})$ pebbles; to cover $v_{\frac{m}{2} + 1}$ we need $2^{\frac{m}{2} + n}$ pebbles. Thus, we used $2 (\sum_{k = \frac{m}{2} + n + 1}^{m + n - 2} 2^{k}) + 3 (2^{n + 1}) + 2^{\frac{m}{2} + n} - 1$ pebbles.

Subcase 1.2: Let $β = v_{1}$ .

To cover the vertices $v_{1}, u_{1}, u_{2}, \dots, u_{n}$ , it will cost $2^{n + 1} - 1$ pebbles; to cover the vertices $v_{2}, v_{m}$ it will cost $4$ pebbles; to cover the vertices $v_{2}, v_{3}, \dots, v_{\frac{m}{2}}, v_{\frac{m}{2} + 2}, \dots, v_{m - 1}$ it will cost $2 (\sum_{i = \frac{m}{2} + 1}^{m - 2} 2^{i})$ pebbles; to cover $v_{\frac{m}{2} + 1}$ it will cost $2^{\frac{m}{2}}$ pebbles. Thus, we used $2 (\sum_{i = \frac{m}{2} + 1}^{m - 2} 2^{i}) + 2^{\frac{m}{2}} + 2^{n + 1} + 3$ pebbles.

Case 2: When $m$ is odd.

Let $p (u_{n}) = 2 (\sum_{k = ⌈ \frac{m}{2} ⌉ + n}^{m + n - 2} 2^{k}) + 3 (2^{n + 1}) - 2.$ To cover the vertices $v_{2}, v_{1}, u_{1}, u_{2}, \dots, u_{n}$ , we need $2^{n + 2} - 1$ pebbles; to cover $v_{m}$ , we need $2^{n + 1}$ pebbles; to cover $v_{2}, v_{3}, \dots, v_{m - 1}$ , we need $2 (\sum_{k = ⌈ \frac{m}{2} ⌉ + n}^{m + n - 2} 2^{k}) .$ Thus, in this case: $γ_{μ} (T_{m, n}) \geq 2 (\sum_{k = ⌈ \frac{m}{2} ⌉ + n}^{m + n - 2} 2^{k}) + 3 (2^{n + 1}) - 1.$ The equality holds when $β = u_{n}$ or $v_{1}$ .

Theorem 2.6.

For $L (m, n), γ_{μ} (L (m, n)) = 2^{n + 1} - 1 + (m - 1) 2^{n + 1} .$

Proof. Let $V (L (m, n)) = {v_{1}, v_{2}, \dots, v_{m}, u_{1}, u_{2}, \dots, u_{n}}$ where $m$ vertices form a complete graph and $n$ vertices form a path of order $n$ . Without loss of generality, consider a bridge between $u_{1}$ and $v_{1}$ . Let $p (u_{n}) = 2^{n + 1} - 2 + (m - 1) 2^{n + 1} .$ To cover the vertices $v_{2}, v_{3}, \dots, v_{m}$ , it will cost $(m - 1) 2^{n + 1}$ pebbles; to cover the vertices $u_{n - 1}, u_{n - 2}, \dots, u_{1}, v_{1}$ , it will cost $2^{n + 1} - 2$ pebbles, and there is no pebble left to cover $u_{n}$ . Thus, $γ_{μ} (L (m, n)) \geq 2^{n + 1} - 1 + (m - 1) 2^{n + 1} .$

Now we prove $γ_{μ} (L (m, n)) \leq 2^{n + 1} - 1 + (m - 1) 2^{n + 1} .$

Case 1: Let $β = u_{n}$ .

Let the monophonic path $M_{1} : u_{n}, u_{n - 1}, \dots, u_{1}, v_{1}$ of length $n$ . By Theorem 1.2, to cover $p (V (M_{1}))$ , we require $2^{n + 1} - 1$ pebbles; to cover the vertices $v_{2}, v_{3}, \dots, v_{m}$ , which are at a monophonic distance of $n + 1$ , we need $(m - 1) 2^{n + 1}$ pebbles. Thus, to cover all the vertices, it will cost $γ_{μ} (L (m, n)) = 2^{n + 1} - 1 + (m - 1) 2^{n + 1}$ pebbles.

Case 2: Let $β = v_{2}$ .

Consider the monophonic path $M_{2} : v_{2}, v_{1}, u_{1}, u_{2}, \dots, u_{n}$ of length $n + 1$ . By Theorem 1.2, to cover $p (V (M_{2}))$ , we require $2^{n + 2} - 1$ pebbles; to cover the vertices $v_{3}, v_{4}, \dots, v_{m}$ , which are adjacent to $v_{2}$ , it will cost $2 (m - 2)$ pebbles. Thus, to cover all the vertices from $v_{2}$ , it will cost $2^{n + 2} - 1 + 2 (m - 2)$ pebbles. By symmetry, the same can be proven for the vertices $v_{3}, v_{4}, \dots, v_{m}$ .

We observe that if the source vertices are $u_{n - 1}, u_{n - 2}, \dots, u_{1}, v_{1}$ , then the monophonic cover pebbling number of these vertices will lie between Case 1 and Case 2.

Theorem 2.7.

For the double star-path graph $P_{n} (l, m)$ , $γ_{μ} (P_{n} (l, m)) = 2^{n + 2} + 2^{n + 1} (l - 1) + 2^{2} (m - 1), where l \geq m .$

Proof. Let $V (P_{n} (l, m)) = {x_{0}, x_{1}, \dots, x_{l}, y_{0}, y_{1}, \dots, y_{m}, v_{1}, v_{2}, \dots, v_{n}}$ and $E (P_{n} (l, m)) = {x_{0} x_{i}, x_{0} v_{1}, v_{s} v_{s + 1}, v_{n} y_{0}, y_{0} y_{j}},$ where $i = 1, 2, \dots, l$ , $s = 1, 2, \dots, n - 1$ , and $j = 1, 2, \dots, m$ . Let $p (y_{1}) = 2^{n + 2} + 2^{n + 1} (l - 1) + 2^{2} (m - 1) - 1.$ To cover the vertices $y_{1}, y_{0}, v_{1}, v_{2}, \dots, v_{n}, x_{0}, x_{1}$ , it will cost $2^{n + 2} - 1$ pebbles; to cover $x_{2}, x_{3}, \dots, x_{l}$ , it will cost $(l - 1) 2^{n + 1}$ pebbles; to cover $y_{2}, y_{3}, \dots, y_{m}$ , it will cost $4 (m - 1)$ pebbles, but we have $4 (m - 1) - 1$ pebbles. Thus, there will be a vertex without cover. Hence, $γ_{μ} (P_{n} (l, m)) \geq 2^{n + 2} + 2^{n + 1} (l - 1) + 2^{2} (m - 1), where l \geq m .$

Now we prove $γ_{μ} (P_{n} (l, m)) \leq 2^{n + 2} + 2^{n + 1} (l - 1) + 2^{2} (m - 1), where l \geq m .$

Case 1: Let $β = y_{1}$ .

Let us consider the monophonic path $M_{1} : y_{1}, y_{0}, v_{1}, v_{2}, \dots, v_{n}, x_{0}, x_{1}$ of length $n + 1$ . By Theorem 1.2, to cover $p (V (M_{1}))$ , we require $2^{n + 2} - 1$ pebbles; to cover $x_{2}, x_{3}, \dots, x_{l}$ , we require $(l - 1) 2^{n + 1}$ pebbles; to cover $y_{2}, y_{3}, \dots, y_{m}$ , which are at monophonic distance $2$ , we need $(m - 1) 4$ pebbles. Thus, in this case, we used $2^{n + 2} - 1 + (l - 1) 2^{n + 1} + (m - 1) 4 = 2^{n + 2} + (l - 1) 2^{n + 1} + 4 m - 5$ pebbles. By symmetry, the same can be proven for the vertices $y_{2}, y_{3}, \dots, y_{m}$ .

Case 2: Let $β = x_{1}$ .

Let us consider the monophonic path $M_{2} : x_{1}, x_{0}, v_{n}, v_{n - 1}, \dots, v_{1}, y_{0}, y_{1}$ of length $n + 1$ . By Theorem 1.2, to cover $p (V (M_{2}))$ , we require $2^{n + 2} - 1$ pebbles; to cover $y_{2}, y_{3}, \dots, y_{m}$ , we require $(m - 1) 2^{n + 1}$ pebbles; to cover $x_{2}, x_{3}, \dots, x_{l}$ , which are at monophonic distance $2$ , we need $(l - 1) 4$ pebbles. Thus, in this case, we used $2^{n + 2} - 1 + (m - 1) 2^{n + 1} + (l - 1) 4 < 2^{n + 2} + 2^{n + 1} (l - 1) + 2^{2} (m - 1)$ pebbles. Since $l \geq m$ .

Case 3: Let $β = v_{s}$ , where $1 \leq s \leq n$ .

There exist two monophonic paths. Let $M_{3} : v_{k}, v_{k + 1}, \dots, v_{n}, y_{0}, y_{1}$ of length $n - k + 2$ and $M_{4} : v_{k}, v_{k - 1}, \dots, v_{1}, x_{0}, x_{1}$ of length $k + 1$ . By Theorem 1.2, to cover $p (V (M_{3}))$ , we need $2^{n - k + 3} - 1$ pebbles, and to cover $p (V (M_{4}))$ , we need $2^{k + 2} - 1$ pebbles. Now to cover $y_{2}, y_{3}, \dots, y_{m}$ , we need $(m - 1) 2^{n - k + 2}$ pebbles; to cover $x_{2}, x_{3}, \dots, x_{l}$ , we need $(l - 1) 2^{k + 1}$ pebbles. Thus, to cover all the vertices, we require $2^{k + 2} - 1 + 2^{n - k + 3} - 1 + (m - 1) 2^{n - k + 2} + (l - 1) 2^{k + 1} < 2^{n + 2} + 2^{n + 1} (l - 1) + 2^{2} (m - 1)$ pebbles. Similarly, we can prove for $x_{0}$ and $y_{0}$ .

Theorem 2.8.

For the class of fuses $F_{l} (k)$ , $γ_{μ} (F_{l} (k)) = 2^{l + 2} - 1 + (k - 1) 2^{l + 1} .$

Proof. Let $V (F_{l} (k)) = {v_{0}, v_{1}, \dots, v_{l}, v_{l + 1}, \dots, v_{n - 1}}$ and $E (F_{l} (k)) = {v_{i} v_{i + 1}, v_{l} v_{s}},$ where $i = 0, 1, \dots, l - 1$ , $s = l + 1, l + 2, \dots, n - 1$ , and $n = l + k + 1$ . Consider the monophonic path $M_{1} : v_{0}, v_{1}, v_{2}, \dots, v_{l}, v_{l + 1}$ of length $l + 1$ . Let $p (v_{0}) = 2^{l + 2} - 2 + (k - 1) 2^{l + 1} .$ To cover the vertices $v_{l + 2}, v_{l + 3}, \dots, v_{n - 1}$ , we require $(k - 1) 2^{l + 1}$ pebbles. By Theorem 1.2, to cover the vertices of $M_{1}$ , we require $2^{l + 2} - 1$ pebbles, but we have only $2^{l + 2} - 2$ pebbles. Thus, there will be a vertex without cover. Hence, $γ_{μ} (F_{l} (k)) \geq 2^{l + 2} - 1 + (k - 1) 2^{l + 1} .$

Now we prove $γ_{μ} (F_{l} (k)) \leq 2^{l + 2} - 1 + (k - 1) 2^{l + 1} .$

Case 1: Let $β = v_{0}$ .

Consider the path $M_{1}$ . By Theorem 1.2, to cover $p (V (M_{1}))$ , we require $2^{l + 2} - 1$ pebbles. To cover the $k$ vertices $v_{l + 2}, v_{l + 3}, \dots, v_{n - 1}$ , which are at the monophonic distance $l + 1$ , we require $(k - 1) 2^{l + 1}$ pebbles. Thus, with a configuration of $2^{l + 2} - 1 + (k - 1) 2^{l + 1}$ pebbles, we can cover all the vertices. Similarly, we can prove for the vertices $v_{l + 1}, v_{l + 2}, \dots, v_{n - 1}$ .

Case 2: Let $β = v_{j}$ , where $j = 1, 2, \dots, l$ .

There exist two different monophonic paths: $M_{2} : v_{j}, v_{j + 1}, \dots, v_{l}, v_{l + 1},$ of length $l - j + 1$ and $M_{3} : v_{j}, v_{j - 1}, \dots, v_{0},$ of length $j$ . By Theorem 1.2, to cover $V (M_{2})$ , we require $2^{l - j + 2} - 1$ pebbles; to cover $V (M_{3})$ , we require $2^{j + 1} - 2$ pebbles; and to cover the vertices $v_{l + 2}, v_{l + 3}, \dots, v_{n - 1}$ , we require $(k - 1) 2^{l - j + 1}$ pebbles. Thus, to cover all the vertices, we require $2^{l - j + 2} - 1 + 2^{j + 1} - 2 + (k - 1) 2^{l - j + 1} = 3 (2^{l - j + 1}) + (k - 1) 2^{l - j + 1} < 2^{l + 2} - 1 + (k - 1) 2^{l + 1} .$

References:

J. Bondy and U. Murty. Graph theory with applications. Macmillan, 1977.
G. Chartrand. Introductory Graph Theory. Dover Books on Mathematics. Dover Publications, 1985.
B. Crull, T. Cundiff, P. Feltman, G. Hurlbert, L. Pudwell, Z. Szaniszlo, and Z. Tuza. The cover pebbling number of graphs. Discrete Mathematics, 296:15–23, 2005.
S. N. Daoud and K. Mohamed. The complexity of some families of cycle-related graphs. Journal of Taibah University for Science, 11:205–228, 2017. https://doi.org/10.1016/j.jtusci.2016.04.002.
G. Hurlbert. A survey of graph pebbling. Congressus Numerantium, 139:41–64, 1999.
G. Hurlbert and B. Munyan. Cover pebbling hypercubes. Bulletin of the Institute of Combinatorics and its Applications, 47:71–76, 2006.
A. Lourdusamy, I. Dhivviyanandam, and S. Kitheriammal. Monophonic pebbling number and t-pebbling number of some graphs. AKCE International Journal of Graphs and Combinatorics, 2022. https://doi.org/10.1080/09728600.2022.207278.
A. Lourdusamy, S. Kitheriammal, and I. Dhivviyanandam. Monophonic cover pebbling number of some path related graphs. Industrial Engineering Journal, 52(4):167–170, Apr. 2023.
A. Santhakumaran and P. Titus. Monophonic distance in graphs. Discrete Mathematics, Algorithms and Applications, 3(2):159–169, 2011. https://doi.org/10.1142/S1793830911001176.
M. E. Subido and I. S. Aniversario. The cover pebbling number of the join of some graphs. Applied Mathematical Sciences, 2014. https://doi.org/10.12988/ams.2014.45377.
A. Vuong and I. Wyckoff. Conditions for weighted cover pebbling of graphs. http://arxiv.org/abs/math/0410410, 2005. Manuscript.
E. W. Weisstein. Tadpole graph. https://mathworld.wolfram.com/TadpoleGraph.html. Accessed: 2024-11-28.

[1] J. Bondy and U. Murty. Graph theory with applications. Macmillan, 1977.

[2] G. Chartrand. Introductory Graph Theory. Dover Books on Mathematics. Dover Publications, 1985.

[3] B. Crull, T. Cundiff, P. Feltman, G. Hurlbert, L. Pudwell, Z. Szaniszlo, and Z. Tuza. The cover pebbling number of graphs. Discrete Mathematics, 296:15–23, 2005.

[4] S. N. Daoud and K. Mohamed. The complexity of some families of cycle-related graphs. Journal of Taibah University for Science, 11:205–228, 2017. https://doi.org/10.1016/j.jtusci.2016.04.002.

[5] G. Hurlbert. A survey of graph pebbling. Congressus Numerantium, 139:41–64, 1999.

[6] G. Hurlbert and B. Munyan. Cover pebbling hypercubes. Bulletin of the Institute of Combinatorics and its Applications, 47:71–76, 2006.

[7] A. Lourdusamy, I. Dhivviyanandam, and S. Kitheriammal. Monophonic pebbling number and t-pebbling number of some graphs. AKCE International Journal of Graphs and Combinatorics, 2022. https://doi.org/10.1080/09728600.2022.207278.

[8] A. Lourdusamy, S. Kitheriammal, and I. Dhivviyanandam. Monophonic cover pebbling number of some path related graphs. Industrial Engineering Journal, 52(4):167–170, Apr. 2023.

[9] A. Santhakumaran and P. Titus. Monophonic distance in graphs. Discrete Mathematics, Algorithms and Applications, 3(2):159–169, 2011. https://doi.org/10.1142/S1793830911001176.

[10] M. E. Subido and I. S. Aniversario. The cover pebbling number of the join of some graphs. Applied Mathematical Sciences, 2014. https://doi.org/10.12988/ams.2014.45377.

[11] A. Vuong and I. Wyckoff. Conditions for weighted cover pebbling of graphs. http://arxiv.org/abs/math/0410410, 2005. Manuscript.

[12] E. W. Weisstein. Tadpole graph. https://mathworld.wolfram.com/TadpoleGraph.html. Accessed: 2024-11-28.

Contents

Utilitas Mathematica

Monophonic cover pebbling number $(M C P N)$ of network graphs

Abstract

1. Introduction

2. $M C P N$ of families of network graphs

References:

Information

Guidelines

CP Initiatives

Follow CP

Contents

Utilitas Mathematica

Monophonic cover pebbling number (MCPN) of network graphs

Abstract

1. Introduction

2. MCPN of families of network graphs

References:

Information

Guidelines

CP Initiatives

Follow CP

Monophonic cover pebbling number $(M C P N)$ of network graphs

2. $M C P N$ of families of network graphs