The self-similarity of complex networks: From the view of degree–degree distance

Self-similarity of complex networks has been discovered and attracted much attention. However, the self-similarity of complex networks was measured by the classical distance of nodes. Recently, a new feature, which is named as degree–degree distance, is used to measure the distance of nodes. In the definition of degree–degree distance, the relationship between two nodes is dependent on degree of nodes. In this paper, we explore the self-similarity of complex networks from the perspective of degree–degree distance. A box-covering algorithm based on degree–degree distance is proposed to calculate the value of dimension of complex networks. Some complex networks are studied, and the results show that these networks have self-similarity from the perspective of degree–degree distance. The proposed method for measuring self-similarity of complex networks is reasonable.

On Certain Aspects of Topological Indices

A topological index, also known as connectivity index, is a molecular structure descriptor calculated from a molecular graph of a chemical compound which characterizes its topology. Various topological indices are categorized based on their degree, distance, and spectrum. In this study, we calculated and analyzed the degree-based topological indices such as first general Zagreb index M r G , geometric arithmetic index GA G , harmonic index H G , general version of harmonic index H r G , sum connectivity index λ G , general sum connectivity index λ r G , forgotten topological index F G , and many more for the Robertson apex graph. Additionally, we calculated the newly developed topological indices such as the AG 2 G and Sanskruti index for the Robertson apex graph G.

Computing Exact Values for Gutman Indices of Sum Graphs under Cartesian Product

Gutman index of a connected graph is a degree-distance-based topological index. In extremal theory of graphs, there is great interest in computing such indices because of their importance in correlating the properties of several chemical compounds. In this paper, we compute the exact formulae of the Gutman indices for the four sum graphs (S-sum, R-sum, Q-sum, and T-sum) in the terms of various indices of their factor graphs, where sum graphs are obtained under the subdivision operations and Cartesian products of graphs. We also provide specific examples of our results and draw a comparison with previously known bounds for the four sum graphs.

On Extremal Graphs of Degree Distance Index by Using Edge-Grafting Transformations Method

Background: Topological indices have numerous implementations in chemistry, biology and in lot of other areas. It is a real number associated to a graph, which provides information about its physical and chemical properties and their correlations. For a connected graph H, the degree distance defined as DD(H)=∑_(\h_1,h_2⊆V(H))〖(〖deg〗_H (h_1 )+〖deg〗_H (h_2 )) d_H (h_1,h_2 ) 〗, where 〖deg〗_H (h_1 ) is the degree of vertex h_1and d_H (h_1,h_2 ) is the distance between h_1and h_2in the graph H. Aim and Objective: In this article, we characterize some extremal trees with respect to degree distance index which has a lot of applications in theoretical and computational chemistry. Materials and Methods: A novel method of edge-grafting transformations is used. We discuss the behavior of DD index under four edge-grafting transformations. Results: By the help of those transformations, we derive some extremal trees under certain parameters including pendant vertices, diameter, matching and domination numbers. Some extremal trees for this graph invariant are also characterized. Conclusion: It is shown that balanced spider approaches to the smallest DD index among trees having given fixed leaves. The tree Cn,d has the smallest DD index, among the all trees of diameter d. It is also proved that the matching number and domination numbers are equal for trees having minimum DD index.