Repository logoGCRIS
  • English
  • Türkçe
  • Русский
Log In
New user? Click here to register. Have you forgotten your password?
Home
Communities
Browse GCRIS
Overview
GCRIS Guide
  1. Home
  2. Browse by Author

Browsing by Author "Naeem, Mustafa"

Filter results by typing the first few letters
Now showing 1 - 1 of 1
  • Results Per Page
  • Sort Options
  • Loading...
    Thumbnail Image
    Article
    Study of Some Connectivity Index of Subdivided Mk Graphs of Ladder and Triangular Ladder Graph
    (Taru Publications, 2020) Cancan, Murat; Afzal, Farkhanda; Mahsud, Minhas; Naeem, Mustafa; Afzal, Deeba
    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.
Repository logo
Collections
  • Scopus Collection
  • WoS Collection
  • TrDizin Collection
  • PubMed Collection
About
  • Contact
  • GCRIS
  • Research Ecosystems
  • Feedback
  • OAI-PMH

Powered by Research Ecosystems

  • Privacy policy
  • End User Agreement
  • Feedback