| Issue |
RAIRO-Oper. Res.
Volume 58, Number 6, November-December 2024
|
|
|---|---|---|
| Page(s) | 5159 - 5166 | |
| DOI | https://doi.org/10.1051/ro/2024175 | |
| Published online | 06 December 2024 | |
Expected value for the k-distance degree index of a graph
Department of Mathematics, Gareziaeddin Center, Khoy Branch, Islamic Azad University, Khoy, Iran
* Corresponding author: hamideh.aram@gmail.com
Received:
30
December
2023
Accepted:
5
September
2024
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.
Mathematics Subject Classification: 05C12 / 05C30 / 05C80 / 05C92 / 05D40
Key words: k-distance degree index / expected value / random arranged polygonal string
© The authors. Published by EDP Sciences, ROADEF, SMAI 2024
This is an Open Access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.