Maximal matching cover pebbling number for variants of hypercube

Title

Maximal matching cover pebbling number for variants of hypercube

Creator

Surya S.S.; Mathew L.

Description

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. (2023), (SciELO-Scientific Electronic Library Online). All Rights Reserved.

Source

Proyecciones, Vol-42, No. 4, pp. 931-956.

Date

2023-01-01

Publisher

Universidad Catolica del Norte

Subject

Cover pebbling number; Graph pebbling; Maximal matching; Maximal matching cover pebbling number

Coverage

Surya S.S., Stella Maris College(Autonomous), India; Mathew L., CHRIST (Deemed to be University), India

Rights

All Open Access; Gold Open Access; Green Open Access

Relation

ISSN: 7160917

Format

Online

Language

English

Type

Article

Identifier

https://doi.org/10.22199/ISSN.0717-6279-5608

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85170201080&doi=10.22199%2fISSN.0717-6279-5608&partnerID=40&md5=a68535f5e99214accf19c270834030cc