Topological efficiency under graph operations
2017
In this paper we present explicit formulas for computing the topological efficiency index of the most important graph operations such as the Cartesian product, composition, corona, join and hierarchical product of two graphs. We apply our results to compute this distance-related invariant for some important classes of molecular graphs and nano-structures by specializing components of these graph operations.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
15
References
5
Citations
NaN
KQI