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

Murat Cancan, Farkhanda Afzal, Minhas Mahsud, Mustafa Naeem, Deeba Afzal

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

Abstract

An mk-graph of a graph G is defined by taking m ≥ 2 copies G1, … , Gm of a graph G in which every vertex uh of copy Gis adjacent to a corresponding vertex vm of copy Gm. An mk-graph is represented by mk(G). In this paper we work on some degree based connectivity indices of subdivided mk-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.
Original languageEnglish
Pages (from-to)1279-1296
Number of pages18
JournalJournal of Discrete Mathematical Sciences and Cryptography
Volume23, 2020
Issue number6
Early online date27 Oct 2020
DOIs
Publication statusPublished online - 27 Oct 2020

Keywords

  • mk-graph
  • Ladder graph
  • Triangular ladder graph
  • Zagreb indices
  • Augmented Zagreb index

Fingerprint

Dive into the research topics of 'Study of some connectivity index of subdivided mk graphs of ladder and triangular ladder graph'. Together they form a unique fingerprint.

Cite this