On the eccentric connectivity polynomial of F-sum of connected graphs

DOI10.1155/2020/5061682MaRDI QIDQ2196156zbMATH OpenOpenAlexFDO

Authors M. Imran, Shehnaz Akhter, Z. Iqbal

Publication date 28 August 2020

Published in Complexity (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2020/5061682

Mathematics Subject Classification ID

Graph polynomials (05C31) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)

Review text

Summary: The eccentric connectivity polynomial (ECP) of a connected graph \(G=(V(G), E(G\)) is described as \(\xi^c G\), \(y= \sum_{a\in V(G)} \deg_G (a)y^{e c_G(a)}\), where \(e c_G(a)\) and \(\deg_G(a)\) represent the eccentricity and the degree of the vertex \(a\), respectively. The eccentric connectivity index (ECI) can also be acquired from \(\xi^c(G,y)\) by taking its first derivatives at \(y=1\). 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 \(\mathcal{F}\)-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.

Recommendations

• The eccentric connectivity polynomial of some graph operations
• Eccentric connectivity polynomial of some graph operations
• The sum of squares of eccentricity of connected graphs
• scientific article; zbMATH DE number 7509362
• On connective eccentricity index of graphs
• Some extremal results on the connective eccentricity index of graphs
• On the eccentric connectivity index of a graph
• The eccentric distance sum of connected graphs
• On the extremal eccentric connectivity index of graphs
• Modified eccentric connectivity polynomial of some graph operations

Cites work

• Characterization of graphs using domination polynomials
• Computing the forgotten topological index of four operations on graphs
• Computing topological polynomials of mesh-derived networks
• Eccentric connectivity index of composite graphs
• Eccentric connectivity index of hexagonal belts and chains
• Eccentric connectivity polynomial of some graph operations
• Four new sums of graphs and their Wiener indices
• Graphs with integer matching polynomial zeros
• scientific article; zbMATH DE number 6296695 (Why is no real title available?)
• Hyper- and reverse-Wiener indices of F-sums of graphs
• On the edge cover polynomial of a graph
• Optimal decay rate estimates of a nonlinear viscoelastic Kirchhoff plate
• The eccentric connectivity polynomial of some graph operations
• The generalized hierarchical product of graphs
• The hierarchical product of graphs
• The hyper-Wiener index of the generalized hierarchical product of graphs
• The sharp bounds on general sum-connectivity index of four operations on graphs
• Total eccentricity index of the generalized hierarchical product of graphs
• Vertex PI indices of four sums of graphs

Cited in

(1)

• Eccentric connectivity polynomial of some graph operations

This page was built for publication: On the eccentric connectivity polynomial of \(\mathcal{F}\)-sum of connected graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2196156)