Maximal matching cover pebbling number for variants of hypercube

• Sarah Surya, S. ^[1] ; Mathew Koipuram, Lian
  1. [1] Stella Maris College (Autonomous).
• Localización: Proyecciones: Journal of Mathematics, ISSN 0716-0917, ISSN-e 0717-6279, Vol. 42, Nº. 4, 2023, págs. 931-956
• Idioma: inglés
• Enlaces
  • Texto completo
• Resumen

  • An edge pebbling move is defined as the removal of two pebbles from one edge and placing one on the adjacent edge. The maximal matching cover pebbling number, fmmcp(G), of a graph G, is the minimum number of pebbles that must be placed on E(G), such that after a sequence of pebbling moves the set of edges with pebbles forms a maximal matching regardless of the initial configuration. In this paper, we find the maximal matching cover pebbling number for variants of hypercube.