Measurements of graphs and retrieving structural information complex networks using degree-based network entropy have become an informational theoretical concept. This terminology is extended by the concept Shannon entropy. In this paper, we introduce with having edge weights which are basically redefined Zagreb indices. Some bounds calculated to idealize performance in limiting different kinds...

The use of graph theory can be visualized in nanochemistry, computer networks, Google maps, and molecular which are common areas to elaborate application this subject. In a numeric number (topological index) is used estimate the biological, physical, structural properties chemical compounds that associated with graph. paper, we compute first second multiplicative Zagreb indices ( <math xmlns="h...

We consider topological indices I that are sums of f(deg(u))f(deg(v)), where {u, v} are adjacent vertices and f is a function. The Randić connectivity index or the Zagreb group index are examples for indices of this kind. In earlier work on topological indices that are sums of independent random variables, we identified the correlation between I and the edge set of the molecular graph as the ma...

For a simple graph G with n vertices and m edges, the inequality M1(G)/n ≤ M2(G)/m, where M1(G) and M2(G) are the first and the second Zagreb indices of G, is known as Zagreb indices inequality. According to this inequality, a set S of integers is good if for every graph whose degrees of vertices are in S, the inequality holds. We characterize that an interval [a, a+n] is good if and only if a ...