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 Gh is 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 language | English |
---|---|
Pages (from-to) | 1279-1296 |
Number of pages | 18 |
Journal | Journal of Discrete Mathematical Sciences and Cryptography |
Volume | 23, 2020 |
Issue number | 6 |
Early online date | 27 Oct 2020 |
DOIs | |
Publication status | Published online - 27 Oct 2020 |
Keywords
- mk-graph
- Ladder graph
- Triangular ladder graph
- Zagreb indices
- Augmented Zagreb index