In the classical cases, special graph invariants (e.g., number of vertices, edges, degrees, distances etc).
This generalization led to numerous information-theoretic graph complexity measures by applying equivalence criteria like vertex degrees, distances to chemical graphs etc. [2], [8], [21].
The properties of the degree distance index were studied in [9 12].
A next forwarder selection function is designed based on the residual energy, node degree, distance, and angle.
In this paper, we characterize the n-vertex tricyclic graphs which have the minimum generalized degree distance.
In this paper, we characterize all of n-vertex tricyclic graphs which have the minimum generalized degree distance.
There are two papers [6, 7], which introduced a new graph invariant with the name degree distance.
It is defined as follows: Generalized degree distance is denoted by H λ ( G ) and defined as follows in [8].
Existing graph-theory metrics such as density, average node degree, distance or betweenness, fail to capture trade-offs between isolation and replication.
In (Hamzeh et al. in Stud. Univ. Babeş-Bolyai, Chem., 4 73-85, 2012), we introduced a generalization of a degree distance of graphs as a new topological index.
DARA replaces the failed node "F" with one of its neighbor picked based on the node degree, distance, and ID, respectively.
