On the Eccentric Connectivity Polynomial of - Sum of Connected Graphs

Muhammad Imran, Shehnaz Akhter and Zahid Iqbal

Complexity, 2020, vol. 2020, 1-9

Abstract:

The eccentric connectivity polynomial (ECP) of a connected graph is described as , where and represent the eccentricity and the degree of the vertex , respectively. The eccentric connectivity index (ECI) can also be acquired from by taking its first derivatives at . The ECI has been widely used for analyzing both the boiling point and melting point for chemical compounds and medicinal drugs in QSPR/QSAR studies. As the extension of ECI, the ECP also performs a pivotal role in pharmaceutical science and chemical engineering. Graph products conveniently play an important role in many combinatorial applications, graph decompositions, pure mathematics, and applied mathematics. In this article, we work out the ECP of - sum of graphs. Moreover, we derive the explicit expressions of ECP for well-known graph products such as generalized hierarchical, cluster, and corona products of graphs. We also apply these outcomes to deduce the ECP of some classes of chemical graphs.

Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/8503/2020/5061682.pdf (application/pdf)
http://downloads.hindawi.com/journals/8503/2020/5061682.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:complx:5061682

DOI: 10.1155/2020/5061682

Access Statistics for this article

More articles in Complexity from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem (mohamed.abdelhakeem@hindawi.com).