Study of Some Connectivity Index of Subdivided Mk Graphs of Ladder and Triangular Ladder Graph

Abstract

An m(k)-graph of a graph G is defined by taking m >= 2 copies G(v), ..., G(m) of a graph G in which every vertex u(h) of copy G(h) is adjacent to a corresponding vertex v(m) of copy G(m). An m(k)-graph is represented by m(k)(G). In this paper we work on some degree based connectivity indices of subdivided m(k)-graph generated by ladder and triangular ladder graph. Also closed formulas for computing various degree based topological indices of said families of graphs have been presented.