Study of some connectivity index of subdivided mk graphs of ladder and triangular ladder graph


Cancan M. , Afzal F., Mahsud M., Naeem M., Afzal D.

JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY, cilt.23, ss.1279-1296, 2020 (ESCI İndekslerine Giren Dergi) identifier identifier

  • Cilt numarası: 23 Konu: 6
  • Basım Tarihi: 2020
  • Doi Numarası: 10.1080/09720529.2020.1819677
  • Dergi Adı: JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY
  • Sayfa Sayıları: ss.1279-1296

Özet

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.