t-pebbling property satisfies the C_5×C_5×C_5 Graph

Main Article Content

Jitendra Binwal, et. al.


A graph pebbling is mathematical game play on the vertices of graph with respect to the pebbling steps. The pebbling step is the shifting of two pebbles and attachment of one pebble on the specified arbitrary vertex. The -pebbling number of the graph,  is the maximum of  over all the vertices of  where,  is the pebbling number of a vertex . We propose the pebbling number of  where  graph is with  vertices.


Download data is not yet available.


Metrics Loading ...

Article Details

How to Cite
et. al., J. B. . (2021). t-pebbling property satisfies the C_5×C_5×C_5 Graph. Turkish Journal of Computer and Mathematics Education (TURCOMAT), 12(12), 3936–3940. https://doi.org/10.17762/turcomat.v12i12.8181
Research Articles