"

Cookies ussage consent

Our site saves small pieces of text information (cookies) on your device in order to deliver better content and for statistical purposes. You can disable the usage of cookies by changing the settings of your browser. By browsing our site without changing the browser settings you grant us permission to store that information on your device.

Eccentric connectivity index of bridge graphs

M. MOGHARRAB1,*

Affiliation

  1. Department of Mathematics, Persian Gulf University, Bushehr75169, Iran

Abstract

The eccentric connectivity index ) (G ξ of the graph ) , ( E V G G = is defined as Σ∈ = u V ξ (G) degG (u)ε (u) where degG (u) denotes the degree of vertex u in the graph G and ε (u) is the largest distance between u and any other vertex v of G. In this paper, we calculate the eccentric connectivity index of bridge graph of the given graphs and distinguished vertices of them..

Keywords

Eccentric connectivity index, Bridge graph.

Citation

M. MOGHARRAB, Eccentric connectivity index of bridge graphs, Optoelectronics and Advanced Materials - Rapid Communications, 4, 11, November 2010, pp.1866-1867 (2010).

Submitted at: Sept. 28, 2010

Accepted at: Nov. 10, 2010