Year: 2026
Type: article
Abstract: 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(n) with (n+1) levels/stages. The cases in which these determined bounds are tight are also explored.
Source: Symmetry
DOI: 10.3390/sym18040662
Institution: SASTRA University
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: gold
Estimated APC paid: $2,896
OpenAlex ID: W7154516778