The theory of chemical reaction networks is a branch of mathematical sciences that aims to simulate real world behavior. This has received increasing attention of researchers, primarily due to its biological and empirical chemistry applications. Because of the fascinating problems that emerge from the mathematical structures involved, it has aroused interest of pure mathematicians as well. In this paper, we estimate a few degree based irregularity topological indices for some nanotubes and nanotorus like HAC₅C₆C₇[α,β], KTUC[α, β], and GTUC[α,β] based on the degree of the end vertices of each edge.

This article investigates hop and 2-hop domination numbers, each defined by the minimum of its hop (2-hop) dominating sets on the honeycomb and butterfly networks, which have enormous applications in chemistry, engineering, parallel computing, etc. Furthermore, we obtain an upper bound on a regular honeycomb mesh network $HC(n,k)$ and a lower bound for an n-dimensional butterfly network $BF\left(n\right)$ with $(n+1)$ levels/stages. The cases in which these determined bounds are tight are also explored.