MONOPHONIC PEBBLING NUMBER OF DERIVED GRAPHS
Keywords:
Monophonic pebbling number, Monophonic distance, Monophonic t-pebbling number, Petersen graph, Kusudama flower graph, Sierpinski triangleAbstract
Objectives: To find the monophonic pebbling number of some derived graphs. Methods: The monophonic pebbling number πµ(G) of a graph G is the least number of pebbles such that after a sequence of pebbling moves a pebble can be placed on any vertex through a monophonic path. Findings: We compute the monophonic pebbling number and monophonic t-pebbling number for generalised petersen graph, Kusudama flower graph and sierpinski triangle.AMS Subject Classification: 05C12, 05C25, 05C38, 05C76.
References
MONOPHONIC PEBBLING NUMBER OF SOME NETWORK-RELATED GRAPHS AROCKIAM LOURDUSAMY, IRUDAYARAJ DHIVVIYANANDAM,
SOOSAIMANICKAM KITHER IAMMAL. J. Appl. Math. & Informatics Vol. 42(2024), No. 1, pp. 77- 83 https://doi.org/10.14317/jami.2024.077
G. Hurlbert, A survey of graph pebbling, Congressus Numerantium 139: 41-64.
