Volume - 13 | Issue-1
Volume - 13 | Issue-1
Volume - 13 | Issue-1
Volume - 13 | Issue-1
Volume - 13 | Issue-1
Let G be a connected graph. An edge pebbling move on G is the process of removing two pebbles from one edge and placing one pebble on the adjacent edge. The cover edge pebbling number of G, denoted by CPE(G) is the minimum number of pebbles required to place a pebble on all the edges of G, however might be the initial configuration is. In this paper, we compute the cover edge pebbling number for Helm graph, Crown graph and Pan graph.