The K-Distance Degree Index of Corona, Neighborhood Corona Products and Join of Graphs

In this paper, we consider only simple graph G = (V,E), i.e., finite, having no loops no multiple and directed edges. A graph G is said to be connected if there is a path between every pair of its vertices.