نتایج جستجو برای: distance index

تعداد نتایج: 623660  

Journal: :iranian journal of mathematical chemistry 2013
l. pourfaraj

recently, hua et al. defined a new topological index based on degrees and inverse ofdistances between all pairs of vertices. they named this new graph invariant as reciprocaldegree distance as 1{ , } ( ) ( ( ) ( ))[ ( , )]rdd(g) = u v v g d u  d v d u v , where the d(u,v) denotesthe distance between vertices u and v. in this paper, we compute this topological index forgrassmann graphs.

ژورنال: سلامت کار ایران 2010
جهانگیری, مهدی, پارساراد, عبدالمجید,

Background and aims:Toxic chemical release from process installation is one of the main hazards in chemical industries which can endanger the health of employees and public in the neighbours of industry in case of occurring chemical release accident. The aim of this study was determining hazard distance of toxic chemical release in one of petrochemical complex for its applicability in emergency...

A. R. Ashrafi F. Gholami-Nezhaad

The edge Szeged index is a new molecular structure descriptor equal to the sum of products mu(e)mv(e) over all edges e = uv of the molecular graph G, where mu(e) is the number of edges which its distance to vertex u is smaller than the distance to vertex v, and nv(e) is defined analogously. In this paper, the edge Szeged index of one-pentagonal carbon nanocone CNC5[n] is computed for the first ...

Journal: :international journal of nanoscience and nanotechnology 2008
a. r. ashrafi f. gholami-nezhaad

the edge szeged index is a new molecular structure descriptor equal to the sum of products mu(e)mv(e) over all edges e = uv of the molecular graph g, where mu(e) is the number of edges which its distance to vertex u is smaller than the distance to vertex v, and nv(e) is defined analogously. in this paper, the edge szeged index of one-pentagonal carbon nanocone cnc5[n] is computed for the first ...

Journal: :transactions on combinatorics 2013
buzohragul eskender elkin vumar

let $g=(v,e)$ be a connected graph. the eccentric connectivity index of $g$, $xi^{c}(g)$, is defined as $xi^{c}(g)=sum_{vin v(g)}deg(v)ec(v)$, where $deg(v)$ is the degree of a vertex $v$ and $ec(v)$ is its eccentricity. the eccentric distance sum of $g$ is defined as $xi^{d}(g)=sum_{vin v(g)}ec(v)d(v)$, where $d(v)=sum_{uin v(g)}d_{g}(u,v)$ and $d_{g}(u,v)$ is the distance between $u$ and $v$ ...

Journal: :International Journal of Applied Linguistics and English Literature 2017

L. POURFARAJ

Recently, Hua et al. defined a new topological index based on degrees and inverse of distances between all pairs of vertices. They named this new graph invariant as reciprocal degree distance as 1 { , } ( ) ( ( ) ( ))[ ( , )] RDD(G) = u v V G d u  d v d u v , where the d(u,v) denotes the distance between vertices u and v. In this paper, we compute this topological index for Grassmann graphs.

The Harary index H can be viewed as a molecular structure descriptor composed of increments representing interactions between pairs of atoms, such that their magnitude decreases with the increasing distance between the respective two atoms. A generalization of the Harary index, denoted by Hk, is achieved by employing the Steiner-type distance between k-tuples of atoms. We show that the linear c...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید