SECURE DOMINATION COVER PEBBLING NUMBER FOR VARIANTS OF COMPLETE GRAPHS

DOI10.17654/DM027010105zbMath1499.05501OpenAlexW3164833437MaRDI QIDQ5076129

Lian Mathew, S. Sarah Surya

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

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

Related Items (1)

Maximal matching cover pebbling number for variants of hypercube

Cites Work

• The cover pebbling number of graphs
• Pebbling in Hypercubes
• Unnamed Item
• Unnamed Item
• Unnamed Item

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