NDC pebbling number for some class of graphs

DOI10.61091/JCMCC119-13MaRDI QIDQ6580146zbMATH OpenFDO

Authors A. Lourdusamy, Irudayaraj Dhivviyanandam, Lian Mathew

Publication date 29 July 2024

Published in JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

zbMATH Keywords

cover pebbling numbernon-split dominating setNDC pebbling number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Recommendations

• Domination cover pebbling: graph families
• The domination cover pebbling number of the square of a path
• The domination cover pebbling number for some cyclic graphs and path graphs.
• Domination cover rubbling
• Restricted optimal pebbling and domination in graphs

Cites work

• scientific article; zbMATH DE number 5556286 (Why is no real title available?)
• scientific article; zbMATH DE number 3557814 (Why is no real title available?)
• scientific article; zbMATH DE number 3596896 (Why is no real title available?)
• scientific article; zbMATH DE number 1439473 (Why is no real title available?)
• Pebbling in Hypercubes
• The cover pebbling number of graphs
• The nonsplit domination number of a graph

This page was built for publication: NDC pebbling number for some class of graphs

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