Distance Based Topological Indices of Double graphs and Strong Double graphs
DOI:
https://doi.org/10.23755/rm.v48i0.1207Keywords:
Topological Indices, Double graphs, Strong Double graphsAbstract
Topological index is a numerical representation of structure of graph. They are mainly classified as Distance and Degree based topological indices. In this article Distance based topological indices of Double graphs and Strong Double graphs are calculated. Let $G$ be a graph of order $n$ with the vertex set $ V(G)$ containing vertices $v_1,v_2,....,v_n$. Double graph of graph $G$ is constructed by taking two copies of G in which a vertex $v_i$ in one copy is adjacent to a vertex $v_j$ in the another copy if $ v_i$ and $v_j$ are adjacent in G. Strong Double graph is a double graph in which a vertex $v_i$ in one copy is adjacent to a vertex $v_j$ in the another copy if $i=j$.
References
Akhter Naveed., Amin Murad., Jamil Kamran Muhammad., Gao Wei. Some Distance Based Topological Indices of Strong Double graphs. Asian J. Math. and Applications, 1-11, 2018.
Diudea V. M. J. Chem. Inf. Comput. Sci. {bf37}, 292-299, 1997.
Gutman I., and Trinajstić N. Graph theory and molecular orbitals. Total $pi$-electron energy of alternant hydrocarbons. Chem. Phys. Lett., {bf 17} (4), 535-538, 1972.
Gutman I., Ruščić B., Trinajstić N. and Wilcox C.F. Graph theory and molecular orbitals. XII. Acyclic polyenes. J. Chem. Phys., {bf 62}, 3399-3405, 1975.
Harary F. Graph Theory. Addison-Wesely, Reading, Massachusetts, 1969.
Harary, F. Status and contrastatus. {bf 22}, 23–43, 1959.
Ivanciuc O. QSAR Comparative study of Wiener descriptors for weighted molecular graphs. J. Chem. Inf. Comput. Sci., {bf 40}, 1412−-1422, 2000.
Ivanciuc O., T. Ivanciuc, A. T. Balaban. Quantitative structure property relationship evaluation of structural descriptors derived from the distance and reverse Wiener matrices. Internet Electron. J. Mol. Des., 467−-487, 2002.
Jamil Kamran Muhammad. Distance Based Topological Indices and Double Graph. Iranian J. Math. Chem., 83−-91 , 2017.
Munarini E., C. Perelli Cippo, A. Scagliola, N. Zagaglia Salvi. Double graphs. Discrete Math., {bf308}, 242-254, 2008.
Ramane. S. H., Yalnaik. S. A. Status connectivity indices of graphs and its applications to the boiling point of benzenoid hydrocarbons. J. Appl. Math. Comput., {bf55}, 609--627, 2017.
Randi`c M. novel Molecular descriptor for structure-property studies. Chem. Phys. Lett., {bf211}, 478-483, 1993.
Wiener H. Structural determination of paraffin boiling points. J. Am. Chem. Soc., {bf69} (1), 17-20, 1947.
Downloads
Published
Issue
Section
License
This journal provides immediate open access to its content on the principle that making research freely available to the public supports a greater global exchange of knowledge. The journal is committed to real and immediate open access for academic work. All of the journal articles are free to access immediately from the date of publication. There are no charge for readers to download articles and reviews for their own scholarly use. Benefits of open access for authors, include:
- Free access for all users worldwide
- Increased visibility and readership
- Rapid publication
- No spatial constraints
- Authors can share their research papers on their personal web-pages (i.e. ResearchGate, etc.)
Ratio Mathematica publishes open access articles under the terms of the Creative Commons Attribution (CC BY) License. The Creative Commons Attribution License (CC-BY) allows users to copy, distribute and transmit an article, adapt the article and make commercial use of the article. The CC BY license permits commercial and non-commercial re-use of an open access article, as long as the author is properly attributed. Copyright on any research article published by Ratio Mathematica is retained by the author(s). Authors grant Ratio Mathematica a license to publish the article and identify itself as the original publisher. Authors also grant any third party the right to use the article freely as long as its original authors, citation details and publisher are identified.
For further information visit: https://creativecommons.org/licenses/by/3.0/. The following logo will appear in any paper that will be published from the volume number 31/2016 onwards.
