Abstract
An mk -graph of a graph G is defined by taking m ≥ 2 copies G 1, … , 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Discrete Mathematical Sciences and Cryptography
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
