Bound for secure vertex cover pebbling number of a hypercube towards sustainable transportation for circular economy

View at publisher Summarise with VIRAT
Authors: Lian Mathew, S. Sarah Surya, Diya Susan Mathew
Cited by: 0

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

A pebbling move is the removal of two pebbles from one vertex and placing one pebble on an adjacent vertex. The secure vertex cover pebbling number of a graph G , is the minimum number m so that every distribution of m pebbles can reach some secure vertex cover of G by a sequence of pebbling moves. A region’s ability to grow sustainably is significantly impacted when the number of petrol stations is reduced. By finding the secure vertex cover pebbling number of the graph, we can reduce energy waste (SDG 7: Affordable and Clean Energy), enhance urban planning: (SDG 11: Sustainable Cities and Communities), and promote sustainable transportation (SDG 9: Industry, Innovation, and Infrastructure). We can create innovative approaches that help create a more sustainable, energy-efficient, and ecologically sensitive future by evaluating the secure vertex cover pebbling number. In this paper, a bound for the secure vertex cover pebbling number for hypercube Q n is obtained.

Fields of Study & Subjects

Advanced Graph Theory Research Graph Labeling and Dimension Problems Graph theory and applications

Publication details

Journal / source
CRC Press eBooks
Pages
199–203
Publication date
25 March 2026
Language
EN
Document type
Book chapter