On Distance-Based Topological Descriptors of Subdivision Vertex-Edge Join of Three Graphs

46Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The analysis of networks and graphs through topological descriptors carries out a useful role to derive their underlying topologies. This process has been widely used in biomedicine, cheminformatics, and bioinformatics, where assessments based on graph invariants have been made available for effectively communicating with the various challenging schemes. In the studies of quantitative structure-activity relationships (QSARs) and quantitative structure-property relationships (QSPRs), graph invariants are used to approximate the biological activities and properties of chemical compounds. In this paper, we give the results related to the eccentric-connectivity index, connective eccentricity index, total-eccentricity index, average eccentricity index, Zagreb eccentricity indices, eccentric geometric-arithmetic index, eccentric atom-bond connectivity index, eccentric adjacency index, modified eccentric-connectivity index, eccentric distance sum, Wiener index, Harary index, hyper-Wiener index and degree distance index of a new graph operation named as 'subdivision vertex-edge join' of three graphs.

Cite

CITATION STYLE

APA

Yang, H., Imran, M., Akhter, S., Iqbal, Z., & Siddiqui, M. K. (2019). On Distance-Based Topological Descriptors of Subdivision Vertex-Edge Join of Three Graphs. IEEE Access, 7, 143381–143391. https://doi.org/10.1109/ACCESS.2019.2944860

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free