On binary DCP labeling

DOI10.61091/JCMCC122-21MaRDI QIDQ6625096

Author name not available (Why is that?), F. Patrick, A. Lourdusamy

Publication date: 28 October 2024

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

zbMATH Keywords

domination cover pebblingbinary labeling

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• The domination cover pebbling number of the square of a path
• Pebbling in Hypercubes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: On binary DCP labeling

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