Rubbling Number of Undirected Bipartite Graph with Impetus of Python Coding
A graph rubbling and pebbling move is removable of two pebbles and addition of one pebble with their different prospect of respect of vertices. Using rubbling and pebbling move, a vertex is reachable if a pebble can be moved to the vertex. In this paper, we demonstrate the evaluation of the rubbling number of bipartite graphs with the impetus of Python coding for larger number of vertices.
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.