On Topological Co-Indices of David Derived Networks

Abstract

Topological co-indices are topological files that think about the non-touching arrangements of vertices. Here, we think about the going with some notable topological co-indices. The mathematical qualities of atomic designs, called topological co-indices, which are utilized for the quantitative depiction of the structure of different networks are inspected. The strategy for topological co-indices is broken down as one of the methodologies for deciding the connection between the shape of a substance compounds and their properties. Theory of Chemical Graphs is a branch of graph theory that provides a wealth of possibilities for the scientist. Mathematical chemistry combines graph theory with science, relying on molecular graphs, which include vertices that represent molecules atoms and edges that represent molecules bonds. By using chart fundamental examination and allowance, we study the recently referenced topological co-indices of some engineered nuclear diagrams that as regularly as conceivable appear in clinical, manufactured, and material planning. In this paper, we examine the two sort of David Networks and gain the computation formulae of the co-indices of these organizations. Plus, we examine the results by MATLAB and gain the relationship of the co-indices which they depict the physcio-substance properties.

Keywords:

• Topological coindices
• Zagreb-type coindices
• F-Coindex
• General Randi$\acute{c}$ Coindex
• David derived networks
• Dominating david derived networks

DISCLOSURE STATEMENT

No potential conflict of interest was reported by the authors.

Additional information

Notes on contributors

Yongzhou Lu

Yongzhou Lu, received master's degree from Tsinghua University, Beijing, China in 2015. He is currently an assistant researcher of the Naval Research Academy, Beijing, PRC. His research interests include computer technology and systems engineering. E-mail: [email protected]

Muhammad Kamran Siddiqui

Muhammad Kamran Siddiqui received the PhD degree in discrete mathematics specialization in graph theory from the Abdus Salam School of Mathematical Sciences, Government College University Lahore, Pakistan, in 2014. He has completed Post-Doctoral from Department of Mathematical Sciences, United Arab Emirates University, United Arab Emirates in 2018. Since 2014, he has been an assistant professor with the Department of Mathematics, COMSATS University Islamabad, Lahore Campus, Pakistan. His current research interests include discrete mathematics, graph theory and its applications and chemical graph theory.

Muhammad Nasir

Muhammad Nasir received his MSc Mathematics degree from COMSATS University Islamabad (2016–2018), Sahiwal Campus, Pakistan. He completed his MS Mathematics from COMSATS University Islamabad, Lahore Campus, Pakistan. His research interest is graph theory and its applications. E-mail: [email protected]

Muhammad Farhan Hanif

Muhammad Farhan Hanif received his BS Mathematics degree from University of Education Lahore, Pakistan. He completed his MS Mathematics from COMSATS University Islamabad, Lahore Campus, Pakistan. His research interest is graph theory and its applications. E-mail: [email protected]