JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY, vol.23, no.6, pp.1279-1296, 2020 (ESCI)
Article / Article
JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY
Emerging Sources Citation Index (ESCI), Scopus, Academic Search Premier, Aerospace Database, Communication Abstracts, INSPEC, Metadex, zbMATH, Civil Engineering Abstracts
m(k)-graph, Ladder graph, Triangular ladder graph, Zagreb indices, Augmented Zagreb index, TOPOLOGICAL INDEXES, MOLECULAR-ORBITALS, ZAGREB INDEX
Van Yüzüncü Yıl University Affiliated:
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.