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 |
UN SDGs
This output contributes to the following UN Sustainable Development Goals (SDGs)
-
SDG 3 Good Health and Well-being
-
SDG 4 Quality Education
-
SDG 5 Gender Equality
-
SDG 8 Decent Work and Economic Growth
-
SDG 9 Industry, Innovation, and Infrastructure
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
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver