The cut method is a powerful tool for the investigation of distance-based (and some other)
molecular structure-descriptors. In this paper a survey on the recent developments of the …

v∈ S degG (v)] dG (S), where dG (S) is the Steiner distance of S and degG (v) is the degree
of v in G. Expressions for SGutk for some special graphs are obtained. We also give sharp …

Let G be a connected graph, and u, v, w its vertices. By du is denoted the degree of the
vertex u, by d (u, v) the (ordinary) distance of the vertices u and v, and by d (u, v, w) the …

Topological indices are numerical values associated with a graph (structure) that can predict
many physical, chemical, and pharmacological properties of organic molecules and …

Steiner Degree Distance∗ Page 1 Steiner Degree Distance∗ Ya** Mao1, Zhao Wang2, Ivan
Gutman3, Antoaneta Klobucar4 1Department of Mathematics, Qinghai Normal, University, **ning …

Graph invariants, based on the distances between the vertices of a graph, are widely used in
theoretical chemistry. The degree resistance distance of a graph G is defined as DR …

Let G be a connected graph with vertex set V (G). For u, v∈ V (G), d (v) and d (u, v) denote
the degree of the vertex v and the distance between the vertices u and v. A much studied …

Klein et al. found in [Molecular topological index: a relation with the Wiener index, J. Chem.
Inf. Comput. Sci. 32 (1992) 304–305] a relation between degree distance and Wiener index …

Extremal (n, m)-Graphs with Respect to Distance–Degree–Based Topological Indices Page 1
Extremal (n, m)-Graphs with Respect to Distance–Degree–Based Topological Indices Kexiang …

For a graph G=(V, E) and i, j∈ V, denote the distance between i and j in G by D (i, j) and the
degrees of i, j by di, dj, respectively. Let f (D (i, j), di, dj) be a function symmetric in i and j …