Enumeration of the Gutman and Schultz indices in the random polygonal chains
Related Experiment Video
Updated: Aug 28, 2025

Generating Strictly Controlled Stimuli for Figure Recognition Experiments
Published on: March 18, 2019
Wanlin Zhu1, Minglei Fang1, Xianya Geng1
1School of mathematics and big data, Anhui University of Science and Technology, 232001 Huainan, China.
Abstract:
The Gutman index and Schultz index of a connected graph are degree-distance-based topological indices. In this paper, we devoted to establish the explicit analytical expressions for the simple formulae of the expected values of the Gutman and Schultz indices in a random polygonal. Based on these results above, we get the extremal values and average values of Gunman and Schultz indices of all polygonal chains.
Related Concept Videos
Ziegler–Natta Chain-Growth Polymerization: Overview
Radical Chain-Growth Polymerization: Chain Branching
Hückel's Rule Diagram of π MOs: Frost Circle
A Frost circle is constructed by drawing a polygon whose number of edges is equal to the number of carbons of the given cyclic system, with one of the vertices pointing down. Then, a circle is drawn enclosing the polygon so...
Radical Chain-Growth Polymerization: Overview
Routh-Hurwitz Criterion II
The first scenario occurs when a singular zero appears in the first column of the Routh table. This situation creates a division by zero issues. To resolve this, a small positive or negative number, denoted as epsilon (∈), is substituted for the zero. The stability analysis proceeds by assuming a sign for ∈. If ∈ is positive, any sign change in the first...
Wald-Wolfowitz Runs Test II
For binary data, runs are identified using symbols such as + and −, or equivalently, 1s and...

