Rubik’s cube transformation networks
Abstract
Weighted networks can be constructed from the transformation of the Rubik’s Cube with the edge weight as the distance between same colored cubes. Six networks were constructed for each step needed to return the cube to its fixed state. It has been observed that the state of one network affect the other six networks. It has also been shown that the network measures such as the average clustering coefficient, betweenness centrality and average nearest neighbor degree increase as the Rubik’s Cube is being rotated back to its fixed state.
Downloads
Published
Issue
Section
License
By submitting their manuscript to the Samahang Pisika ng Pilipinas (SPP) for consideration, the Authors warrant that their work is original, does not infringe on existing copyrights, and is not under active consideration for publication elsewhere.
Upon acceptance of their manuscript, the Authors further agree to grant SPP the non-exclusive, worldwide, and royalty-free rights to record, edit, copy, reproduce, publish, distribute, and use all or part of the manuscript for any purpose, in any media now existing or developed in the future, either individually or as part of a collection.
All other associated economic and moral rights as granted by the Intellectual Property Code of the Philippines are maintained by the Authors.








