Enumeration of the Gutman and Schultz indices in the random polygonal chains
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 res...
Saved in:
Published in | Mathematical biosciences and engineering : MBE Vol. 19; no. 11; pp. 10826 - 10845 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
AIMS Press
01.01.2022
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | 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. |
---|---|
Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
ISSN: | 1551-0018 1551-0018 |
DOI: | 10.3934/mbe.2022506 |