Fuzzy graphs are very important when we are trying to understand and study complex systems with uncertain and not exact information. Among different types of fuzzy graphs, cubic fuzzy graphs are special due to their ability to represent the membership degree of both vertices and edges using intervals and fuzzy numbers, respectively. To figure out how things are connected in cubic fuzzy graphs, we need to know about cubic α−strong, cubic β−strong and cubic δ−weak edges. These concepts better help in making decisions, solving problems and analyzing things like transportation, social networks and communication systems. The applicability of connectivity and comprehension of cubic fuzzy graphs have urged us to discuss connectivity in the domain of cubic fuzzy graphs. In this paper, the terms partial cubic α−strong and partial cubic δ−weak edges are introduced for cubic fuzzy graphs. The bounds and exact expression of connectivity index for several cubic fuzzy graphs are estimated. The average connectivity index for cubic fuzzy graphs is also defined and some results pertaining to these concepts are proved in this paper. The results demonstrate that removing some vertices or edges may cause a change in the value of connectivity index or average connectivity index, but the change will not necessarily be related to both values. This paper also defines the concepts of partial cubic connectivity enhancing node and partial cubic connectivity reducing node and some related results are proved. Furthermore, the concepts of cubic α−strong, cubic β− strong, cubic δ−weak edge, partial cubic α−strong and partial cubic δ−weak edges are utilized to identify areas most affected by a tsunami resulting from an earthquake. Finally, the research findings are compared with the existing methods to demonstrate their suitability and creativity.