t-pebbling property satisfies the C_5×C_5×C_5 Graph
Main Article Content
Abstract
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.
Downloads
Metrics
Article Details
Licensing
TURCOMAT publishes articles under the Creative Commons Attribution 4.0 International License (CC BY 4.0). This licensing allows for any use of the work, provided the original author(s) and source are credited, thereby facilitating the free exchange and use of research for the advancement of knowledge.
Detailed Licensing Terms
Attribution (BY): Users must give appropriate credit, provide a link to the license, and indicate if changes were made. Users may do so in any reasonable manner, but not in any way that suggests the licensor endorses them or their use.
No Additional Restrictions: Users may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
