The Eccentric-Distance Sum Polynomials of Graphs by Using Graph Products
نویسندگان
چکیده
The correlations between the physico-chemical properties of a chemical structure and its molecular structure-properties are used in quantitative structure-activity property relationship studies (QSAR/QSPR) by using graph-theoretical analysis techniques. It is well known that some structure-property studies, eccentric distance sum, better than corresponding values obtained Wiener index. In this article, we give precise expressions for sum polynomial graph products such as join, Cartesian, lexicographic, corona generalized hierarchical products. We implement our outcomes to calculate significant families graphs form above
منابع مشابه
The eccentric-distance sum of some graphs
Let G = (V,E) be a simple connected graph. The eccentric-distance sum of G is defined as ξ(G) = ∑ {u,v}⊆V (G) [e(u) + e(v)]d(u, v), where e(u) is the eccentricity of the vertex u in G and d(u, v) is the distance between u and v. In this paper, we establish formulae to calculate the eccentric-distance sum for some graphs, namely wheel, star, broom, lollipop, double star, friendship, multi-star g...
متن کاملeccentric connectivity index and eccentric distance sum of some graph operations
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$ ...
متن کاملOn the Adjacent Eccentric Distance Sum Index of Graphs
For a given graph G, ε(v) and deg(v) denote the eccentricity and the degree of the vertex v in G, respectively. The adjacent eccentric distance sum index of a graph G is defined as [Formula in text], where [Formula in text] is the sum of all distances from the vertex v. In this paper we derive some bounds for the adjacent eccentric distance sum index in terms of some graph parameters, such as i...
متن کاملAddressing Graph Products and Distance-Regular Graphs
Graham and Pollak showed that the vertices of any connected graph G can be assigned t-tuples with entries in {0, a, b}, called addresses, such that the distance in G between any two vertices equals the number of positions in their addresses where one of the addresses equals a and the other equals b. In this paper, we are interested in determining the minimum value of such t for various families...
متن کاملDistance preserving graphs and graph products
If G is a graph then a subgraph H is isometric if, for every pair of vertices u, v of H, we have dH(u, v) = dG(u, v) where d is the distance function. We say a graph G is distance preserving (dp) if it has an isometric subgraph of every possible order up to the order of G. We give a necessary and sufficient condition for the lexicographic product of two graphs to be a dp graph. A graph G is seq...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2022
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math10162834