On domination cover edge pebbling number of generalized Petersen Graph, Jewel Graph and triangular snake graph
Journal of Combinatorial Mathematics and Combinatorial Computing · 14.03.2026 · 130 · 151-164
DOI: 10.61091/jcmcc130-11 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Combinatorial Mathematics and Combinatorial Computing, online erschienen am 14.03.2026. Verfasst von S. Vincylin und 1 weiteren Autor:innen.
Abstract (Originalsprache)
Given a configuration of pebbles on the edges of a connected graph G, an edge pebbling move is defined as the removal of two pebbles off an edge and placing one on an adjacent edge. The domination cover edge pebbling number of a graph G is the minimum number of pebbles required such that the set of edges that contain pebbles form an edge dominating set S of G, for the initial configuration of pebbles can be altered by a sequence of pebbling moves and it is denoted by ψe(G) for a graph G. In this paper, we determine ψe(G) for Generalized Petersen graph, Jewel graph and Triangular snake graph.
Zitieren
APA
Vincylin, S., & Gnanaselvi, I. (2026). On domination cover edge pebbling number of generalized Petersen Graph, Jewel Graph and triangular snake graph. Journal of Combinatorial Mathematics and Combinatorial Computing, 130, 151-164. https://doi.org/10.61091/jcmcc130-11
Vancouver
Vincylin S, Gnanaselvi I. On domination cover edge pebbling number of generalized Petersen Graph, Jewel Graph and triangular snake graph. Journal of Combinatorial Mathematics and Combinatorial Computing. 2026;130:151-164. doi:10.61091/jcmcc130-11
BibTeX
@article{Vincylin2026,
author = {Vincylin, S. and Gnanaselvi, I.},
title = {On domination cover edge pebbling number of generalized Petersen Graph, Jewel Graph and triangular snake graph},
journal = {Journal of Combinatorial Mathematics and Combinatorial Computing},
year = {2026},
volume = {130},
pages = {151--164},
doi = {10.61091/jcmcc130-11}
}
EUVIMED