Reformulated reciprocal degree distance and reciprocal degree distance of the complement of the Mycielskian graph and generalized Mycielskian (Q2298347)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Reformulated reciprocal degree distance and reciprocal degree distance of the complement of the Mycielskian graph and generalized Mycielskian |
scientific article; zbMATH DE number 7170746
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reformulated reciprocal degree distance and reciprocal degree distance of the complement of the Mycielskian graph and generalized Mycielskian |
scientific article; zbMATH DE number 7170746 |
Statements
Reformulated reciprocal degree distance and reciprocal degree distance of the complement of the Mycielskian graph and generalized Mycielskian (English)
0 references
20 February 2020
0 references
Summary: The reformulated reciprocal degree distance is defined for a connected graph \(G\) as \(\overline{R}_t(G) = (1 / 2) \sum_{u, \upsilon \in V \left(G\right)}((d_G(u) + d_G(\upsilon)) /(d_G(u, \upsilon) + t))\), \(t \geq 0\), which can be viewed as a weight version of the \(t \)-Harary index; that is, \( \overline{H}_t(G) = (1 / 2) \sum_{u, \upsilon \in V \left(G\right)}(1 /(d_G(u, \upsilon) + t))\), \(t \geq 0\). In this paper, we present the reciprocal degree distance index of the complement of Mycielskian graph and generalize the corresponding results to the generalized Mycielskian graph.
0 references
0 references
0.9557132720947266
0 references
0.8684694170951843
0 references
0.8600234389305115
0 references
0.854017436504364
0 references
0.8539552688598633
0 references