Modeling and Simulation of Quantum Memory Management Problem with Impetus of Graph Isomorphism, Graph Decyclization and Graph Pebbling
The cover pebbling number of graph is the minimum number of pebbles can be configurated in a manner where after a series of pebbling steps, it is possible to have at least one pebble on every vertex ofgraph. In case of directed trees, cover pebbling number is applicable insists of pebbling number. We apply the graph invariant of isomorphism in terms of decyclization and pebbling in quantum memory management problem. Any two isomorphic graphs whose parameters are equivalent to each other such as decyclization and pebbling numbers with impetus of quantum memory management problem.