On the adjacent eccentric distance sum of graphs

Halina Bielak; Katarzyna Wolska

Annales Universitatis Mariae Curie-Skłodowska, sectio A – Mathematica (2014)

  • Volume: 68, Issue: 2
  • ISSN: 0365-1029

Abstract

top
In this paper we show bounds for the adjacent eccentric distance sum of graphs in terms of Wiener index, maximum degree and minimum degree. We extend some earlier results of Hua and Yu [Bounds for the Adjacent Eccentric Distance Sum, International Mathematical Forum, Vol. 7 (2002) no. 26, 1289–1294]. The adjacent eccentric distance sum index of the graph G is defined as ξ s v ( G ) = v V ( G ) ε ( v ) D ( v ) d e g ( v ) , where ε ( v ) is the eccentricity of the vertex v , d e g ( v ) is the degree of the vertex v and D ( v ) = u V ( G ) d ( u , v ) is the sum of all distances from the vertex v .

How to cite

top

Halina Bielak, and Katarzyna Wolska. "On the adjacent eccentric distance sum of graphs." Annales Universitatis Mariae Curie-Skłodowska, sectio A – Mathematica 68.2 (2014): null. <http://eudml.org/doc/289824>.

@article{HalinaBielak2014,
abstract = {In this paper we show bounds for the adjacent eccentric distance sum of graphs in terms of Wiener index, maximum degree and minimum degree. We extend some earlier results of Hua and Yu [Bounds for the Adjacent Eccentric Distance Sum, International Mathematical Forum, Vol. 7 (2002) no. 26, 1289–1294]. The adjacent eccentric distance sum index of the graph $G$ is defined as\[\xi ^\{sv\} (G)= \sum \_\{v\in V(G)\}\{\frac\{\varepsilon (v) D(v)\}\{deg(v)\}\},\] where $\varepsilon (v)$ is the eccentricity of the vertex $v$, $deg(v)$ is the degree of the vertex $v$ and\[D(v)=\sum \_\{u\in V(G)\}\{d(u,v)\}\] is the sum of all distances from the vertex $v$.},
author = {Halina Bielak, Katarzyna Wolska},
journal = {Annales Universitatis Mariae Curie-Skłodowska, sectio A – Mathematica},
keywords = {},
language = {eng},
number = {2},
pages = {null},
title = {On the adjacent eccentric distance sum of graphs},
url = {http://eudml.org/doc/289824},
volume = {68},
year = {2014},
}

TY - JOUR
AU - Halina Bielak
AU - Katarzyna Wolska
TI - On the adjacent eccentric distance sum of graphs
JO - Annales Universitatis Mariae Curie-Skłodowska, sectio A – Mathematica
PY - 2014
VL - 68
IS - 2
SP - null
AB - In this paper we show bounds for the adjacent eccentric distance sum of graphs in terms of Wiener index, maximum degree and minimum degree. We extend some earlier results of Hua and Yu [Bounds for the Adjacent Eccentric Distance Sum, International Mathematical Forum, Vol. 7 (2002) no. 26, 1289–1294]. The adjacent eccentric distance sum index of the graph $G$ is defined as\[\xi ^{sv} (G)= \sum _{v\in V(G)}{\frac{\varepsilon (v) D(v)}{deg(v)}},\] where $\varepsilon (v)$ is the eccentricity of the vertex $v$, $deg(v)$ is the degree of the vertex $v$ and\[D(v)=\sum _{u\in V(G)}{d(u,v)}\] is the sum of all distances from the vertex $v$.
LA - eng
KW -
UR - http://eudml.org/doc/289824
ER -

References

top
  1. Bondy, J. A., Murty, U. S. R., Graph Theory with Applications, Macmillan London and Elsevier, New York, 1976. 
  2. Gupta, S., Singh, M., Madan, A. K., Application of graph theory: Relations of eccentric connectivity index and Wiener’s index with anti-inflammatory activity, J. Math. Anal. Appl. 266 (2002), 259–268. 
  3. Gupta, S., Singh, M., Madan, A. K., Eccentric distance sum: A novel graph invariant for predicting biological and physical properties, J. Math. Anal. Appl. 275 (2002), 386–401. 
  4. Hua, H., Yu, G., Bounds for the Adjacent Eccentric Distance Sum, Int. Math. Forum, 7, no. 26 (2002), 1289–1294. 
  5. Ilic, A., Eccentic connectivity index, Gutman, I., Furtula, B., (Eds.) Novel Molecular Structure Descriptors – Theory and Applications II, Math. Chem. Monogr., vol. 9, University of Kragujevac, 2010. 
  6. Ilic, A., Yu, G., Feng, L., On eccentric distance sum of graphs, J. Math. Anal. Appl. 381 (2011), 590–600. 
  7. Sardana, S., Madan, A. K., Predicting anti-HIV activity of TIBO derivatives: a computational approach using a novel topological descriptor, J. Mol. Model 8 (2000), 258–265. 
  8. Yu, G., Feng, L., Ilic, A., On the eccentric distance sum of trees and unicyclic graphs, J. Math. Anal. Appl. 375 (2011), 99–107. 

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.