On the eccentric connectivity polynomial of \(\mathcal{F}\)-sum of connected graphs

DOI10.1155/2020/5061682zbMath1441.05126OpenAlexW3088354906MaRDI QIDQ2196156

Shehnaz Akhter, Muhammad Imran, Zahid Iqbal

Publication date: 28 August 2020

Published in: Complexity (Search for Journal in Brave)

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The sharp bounds on general sum-connectivity index of four operations on graphs
• Graphs with integer matching polynomial zeros
• The hyper-Wiener index of the generalized hierarchical product of graphs
• Vertex PI indices of four sums of graphs
• On the edge cover polynomial of a graph
• Characterization of graphs using domination polynomials
• Total eccentricity index of the generalized hierarchical product of graphs
• Hyper- and reverse-Wiener indices of F-sums of graphs
• The hierarchical product of graphs
• Four new sums of graphs and their Wiener indices
• The generalized hierarchical product of graphs
• Optimal decay rate estimates of a nonlinear viscoelastic Kirchhoff plate
• Computing the forgotten topological index of four operations on graphs
• Computing topological polynomials of mesh-derived networks

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