SECURE DOMINATION COVER PEBBLING NUMBER FOR VARIANTS OF COMPLETE GRAPHS

DOI10.17654/DM027010105zbMATH Open1499.05501OpenAlexW3164833437MaRDI QIDQ5076129FDOQ5076129

Authors: S. Sarah Surya, Lian Mathew 

Publication date: 16 May 2022

Published in: Advances and Applications in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.17654/dm027010105

zbMATH Keywords

secure dominationgraph pebblingcover pebbling numbersecure domination cover pebbling number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Paths and cycles (05C38)

Cites Work

• Pebbling in Hypercubes
• Title not available (Why is that?)
• Title not available (Why is that?)
• The cover pebbling number of graphs
• Domination cover pebbling: graph families

Cited In (1)

• Maximal matching cover pebbling number for variants of hypercube

This page was built for publication: SECURE DOMINATION COVER PEBBLING NUMBER FOR VARIANTS OF COMPLETE GRAPHS

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