On Broadcast Schemes of Knödel Graphs
M.H. Fakharan, Hovhannes A. Harutyunyan · Parallel Processing Letters · 2024
Knödel graphs on even number of vertices serve as crucial components in constructing various broadcast graphs, particularly those on an odd number of vertices. The efficacy of these constructions heavily relies on the chosen broadcast scheme. Dimensional broadcast schemes are widely employed for broadcasting Knödel graphs. This paper delves into the investigation of standard and reverse dimensional broadcast schemes identifying numerous valid schemes. Specifically, let [Formula: see text] be a Knödel graph of order [Formula: see text] and [Formula: see text]. We explore the impact of [Formula: see text] cyclic shifts on both standard and reverse dimensional broadcast schemes of Knödel graphs, where [Formula: see text], with repetition of the second dimension.