.

ISSN 2063-5346
For urgent queries please contact : +918130348310

PEBBLING IN GOLDBERG SNARK GRAPH

Main Article Content

Sagaya Suganya A, Saibulla A
ยป doi: 10.31838/ecb/2023.12.6.247

Abstract

A pebbling move on a connected graph G = (V, E) is the removal of two pebbles from one vertex and placing one pebble on one of its adjacent vertex. The pebbling number f (G) is the least number of pebbles required in moving one pebble to an arbitrary vertex by a sequence of pebbling moves. In this paper, we have determined the pebbling number of an n โ€“ dimensional Goldberg Snark Gn for n 3.

Article Details