Download This PaperSpanning Cactus Existence in a Three-Dimensional (3 X3 X3) Grid
3 Pages Posted: 3 Apr 2020
Date Written: April 2, 2020
Abstract
Finding a specific subgraph of a given graph, if it exists, is an NP-Complete problem. The existence of a spanning cactus , and finding the minimum spanning cactus in a graph are two such problems. In recent times, the problems have received importance because of its applications in several real life problems. In this short note, we show that there always exists a spanning cactus in a 3 X3 X3 grid graph. The proof of this result is by construction of a spanning cactus of the graph.
Keywords: cactus, minimum spanning cactus, minimum spanning tree, Grid graph, 3-dimensional Grid Graph, NP-Completeness
Suggested Citation: Suggested Citation
Debnath, Chinmay and Datta, Alak Kumar, Spanning Cactus Existence in a Three-Dimensional (3 X3 X3) Grid (April 2, 2020). Proceedings of the International Conference on Innovative Computing & Communications (ICICC) 2020, Available at SSRN: https://ssrn.com/abstract=3566785 or http://dx.doi.org/10.2139/ssrn.3566785
Do you have a job opening that you would like to promote on SSRN?
Feedback
Feedback to SSRN