Maximum Detour-Harary index for some graph classes (Q2333908)
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: Maximum Detour-Harary index for some graph classes |
scientific article; zbMATH DE number 7129586
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximum Detour-Harary index for some graph classes |
scientific article; zbMATH DE number 7129586 |
Statements
Maximum Detour-Harary index for some graph classes (English)
0 references
13 November 2019
0 references
Summary: The definition of a Detour-Harary index is \(\omega H(G) = \frac{1}{2} \sum_{u, v \in V(G)}\frac{1}{l(u, v\vert G)}\), where \(G\) is a simple and connected graph, and \(l(u, v\vert G)\) is equal to the length of the longest path between vertices \(u\) and \(v\). In this paper, we obtained the maximum Detour-Harary index about unicyclic graphs, bicyclic graphs, and cacti, respectively.
0 references
Detour-Harary index
0 references
maximum
0 references
unicyclic
0 references
bicyclic
0 references
cacti
0 references
0 references
0.8477627635002136
0 references
0.8362202048301697
0 references
0.8213376402854919
0 references