On the secure vertex cover pebbling number

DOI10.1142/S1793557123501826MaRDI QIDQ6650889

Lian Mathew, Jasintha Quadras, Glenn H. Hurlbert, S. Sarah Surya

Publication date: 9 December 2024

Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

graph pebblingcover pebbling numbersecure vertex cover

Mathematics Subject Classification ID

Games involving graphs (91A43) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Games on graphs (graph-theoretic aspects) (05C57)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• General graph pebbling
• Restricted optimal pebbling and domination in graphs
• Thresholds for families of multisets, with an application to graph pebbling
• Two-player pebbling on diameter 2 graphs
• A sum labelling for the generalised friendship graph
• The cover pebbling number of graphs
• Pebbling in powers of paths
• Handbook of graph theory
• Pebbling in Hypercubes
• Graph Pebbling: A Blend of Graph Theory, Number Theory, and Optimization
• Monophonic pebbling number and t-pebbling number of some graphs
• Secure vertex cover of a graph
• Pebbling and optimal pebbling in graphs
• The Complexity of Graph Pebbling

This page was built for publication: On the secure vertex cover pebbling number

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