Eccentric connectivity polynomial of some graph operations

Authors

  • Došlić T.
  • Ghorbani M.
  • Hosseinzadeh M.A.

Abstract

The eccentricity connectivity polynomial of a graph G is defined as Ξ(G; x) = Σu∈V(G)δG(u)X∈G(u) where ∈G(u) is the eccentricity of the vertex u and δG(U) its degree. In this paper the eccentric connectivity polynomial is computed for several classes of composite graphs.

Published

2011-05-09

How to Cite

Došlić T., Ghorbani M., & Hosseinzadeh M.A. (2011). Eccentric connectivity polynomial of some graph operations. Utilitas Mathematica, 84. Retrieved from http://utilitasmathematica.com/index.php/Index/article/view/803

Issue

Section

Articles

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.