Show simple item record

Maximal matching cover pebbling number for variants of hypercube

dc.creatorSarah Surya, S.
dc.creatorMathew Koipuram, Lian
dc.date2023-07-18
dc.date.accessioned2023-07-21T14:31:38Z
dc.date.available2023-07-21T14:31:38Z
dc.identifierhttps://www.revistaproyecciones.cl/index.php/proyecciones/article/view/5608
dc.identifier10.22199/issn.0717-6279-5608
dc.identifier.urihttps://revistaschilenas.uchile.cl/handle/2250/232389
dc.descriptionAn 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.en-US
dc.formatapplication/pdf
dc.languageeng
dc.publisherUniversidad Católica del Norte.en-US
dc.relationhttps://www.revistaproyecciones.cl/index.php/proyecciones/article/view/5608/4331
dc.rightsCopyright (c) 2023 S. Sarah Surya, Lian Mathew Koipuramen-US
dc.rightshttps://creativecommons.org/licenses/by/4.0en-US
dc.sourceProyecciones (Antofagasta, On line); Vol. 42 No. 4 (2023); 931-956en-US
dc.sourceProyecciones. Revista de Matemática; Vol. 42 Núm. 4 (2023); 931-956es-ES
dc.source0717-6279
dc.source10.22199/issn.0717-6279-2023-04
dc.subjectgraph pebblingen-US
dc.subjectmaximal matchingen-US
dc.subjectcover pebbling numberen-US
dc.subjectmaximal matching cover pebbling numberen-US
dc.subject05C69en-US
dc.subject05C70en-US
dc.subject54A25en-US
dc.titleMaximal matching cover pebbling number for variants of hypercubeen-US
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/publishedVersion
dc.typetexten-US


This item appears in the following Collection(s)

Show simple item record