f −index of some operations in graph theory
Abstract
This article will address a type of topological index which is called f-index, this type depends on the f-distance, whose bounded value between limited to zero and one, and defined as the sum of all f-distances between any two variant vertices 𝓈 and 𝓇 in Ǥ. Where was found f-index for some operations defined in graph theory such as: join, single join, and double join operations.
Fields of Study & Subjects
Graph theory and applications
Smarandache Functions and Recreational Number Theory
Graph Theory and Algorithms
Publication details
- Journal / source
- AIP conference proceedings
- Volume
- 3393
- Pages
- 070070–070070
- Publication date
- 1 January 2026
- Language
- EN