Maximal matching cover pebbling number for variants of hypercube

DOI10.22199/ISSN.0717-6279-5608MaRDI QIDQ6143697zbMATH OpenFDO

Authors S. Sarah Surya, Lian Mathew

Publication date 24 January 2024

Published in Proyecciones (Antofagasta) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.22199/ISSN.0717-6279-5608

zbMATH Keywords

cover pebbling numbergraph pebblingmaximal matchingmaximal matching cover pebbling number

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Games involving graphs (91A43)

Recommendations

• Cover pebbling hypercubes
• The cover pebbling number of graphs
• Covering cover pebbling number for square of a path
• Covering cover pebbling number for square of a cycle
• Covering cover pebbling number of a hyperbube \& diameter d graphs

Cites work

• Domination cover pebbling: graph families
• Graph theory with applications
• scientific article; zbMATH DE number 1439473 (Why is no real title available?)
• Pebbling in Hypercubes
• SECURE DOMINATION COVER PEBBLING NUMBER FOR VARIANTS OF COMPLETE GRAPHS
• The cover pebbling number of graphs
• The super connectivity of folded crossed cubes

This page was built for publication: Maximal matching cover pebbling number for variants of hypercube

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6143697)