Year: 2024
Type: article
Abstract: For a graph G, the k-distance degree index is Nκ(G) = ∑κ=1diam(G) ( ∑w∈V(G) dκ(w) ) κ. In this article, we calculate the accurate formula of the expected value for k-distance degree index in a random arranged polygonal string with m-arranged polygons. Finally, we determine the average value of this index in the collection of all those arranged polygonal strings.
Source: RAIRO - Operations Research
DOI: 10.1051/ro/2024175
Author: Hamideh Aram
Institution: Islamic Azad University, Khoy Branch
Language: English
Subfield: Geometry and Topology
Field: Mathematics
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W4402299357