NDC pebbling number for some class of graphs

DOI10.61091/JCMCC119-13zbMATH Open1544.05079MaRDI QIDQ6580146FDOQ6580146

Lian Mathew, A. Lourdusamy, Irudayaraj Dhivviyanandam

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)

Cites Work

• Title not available (Why is that?)
• Pebbling in Hypercubes
• Title not available (Why is that?)
• The nonsplit domination number of a graph
• The cover pebbling number of graphs
• Title not available (Why is that?)
• Title not available (Why is that?)

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)