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
• DOI: 10.22199/issn.0717-6279-5608
• 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.

• Referencias bibliográficas
  • J. A. Bondy and US Murty, Graph theory with applications. London: Macmillan, 1976.
  • X. Cai and E. Vumar, “The super connectivity of folded crossed cubes”, Information Processing Letters, vol. 142, pp. 52-56, 2019. https://doi.org10.1016/j.ipl.2018.10.013
  • F. R. K. Chung, “Pebbling in hypercubes”, SIAM Journal on Discrete Mathematics, vol. 2, no. 4, pp. 467-472, 1989. https://doi.org10.1137/0402041
  • B. Crull, T. Cundiff, P. Feltman, GH. Hurlbert, L. Pudwell, Z. Szaniszlo and Z. Tuza, “The cover pebbling number of graphs”, Discrete mathematics,...
  • J. Gardner, A.P. Godbole, A.M. Teguia, A.Z. Vuong, N. Watson and C.R. Yerger, “Domination cover pebbling: graph families”, Journal of Combinatorial...
  • G.H. Hurlbert, “A survey of graph pebbling”, Congressus Numerantium, vol. 139, pp. 41-64, 1999.
  • A. P. Paul, “On Edge Pebbling Number and Cover Edge Pebbling Number of Some Graphs”, Journal of Information and Computational Science, vol....
  • T. L. Holt, J.E. Worley and A.P. Godbole, Explorations in domination cover pebbling. Preprint.
  • S. Sarah and L. Mathew, “On Maximal Matching Cover Pebbling Number”, Advances ad Applications in Mathematical Sciences, vol. 21, no. 11, pp....
  • S. Sarah and L. Mathew, “On Total Secure Domination Cover Pebbling Number”, Communications in Mathematics and Applications, vol. 13, no. 1,...
  • S. Sarah and L. Mathew, “Secure Domination Cover Pebbling Number for Variants of Complete Graphs”, Advances and Applications in Discrete Mathematics,...