Cancan, MuratAfzal, FarkhandaMahsud, MinhasNaeem, MustafaAfzal, Deeba2025-05-102025-05-1020200972-05292169-006510.1080/09720529.2020.18196772-s2.0-85094661917https://doi.org/10.1080/09720529.2020.1819677https://hdl.handle.net/20.500.14720/13792Afzal, Farkhanda/0000-0001-5396-7598; Mahsud, Minhas/0000-0002-1800-8305An 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.eninfo:eu-repo/semantics/closedAccessM(K)-GraphLadder GraphTriangular Ladder GraphZagreb IndicesAugmented Zagreb IndexArticle236N/AQ212791296WOS:000583370300014