1. Monophonic pebbling number of some families of cycles.
- Author
-
Lourdusamy, A., Dhivviyanandam, I., and Kither Iammal, S.
- Subjects
- *
PEBBLES , *GRAPH connectivity - Abstract
Let G be a simple connected graph. A configuration of pebbles is a function from V (G) to a set of integers. Consider a configuration of pebbles on G. A pebbling move consists of removing two pebbles off a vertex and placing one on an adjacent vertex. The monophonic pebbling number of G is the smallest integer μ (G) from which we can put one pebble to a target using monophonic path through pebbling moves. The monophonic t -pebbling number of G is the smallest positive integer μ t (G) such that from any configuration of μ t (G) pebbles we can put t pebbles on a target using monophonic path. Here we discuss these concepts for families of cycles. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF