All sequential dimensional broadcast schemes in Knödel graphs.

Saved in:
Bibliographic Details
Title: All sequential dimensional broadcast schemes in Knödel graphs.
Authors: Fakharan, Mohammadhossein1 (AUTHOR) mohammadhossein.fakharan@mail.concordia.ca, Harutyunyan, Hovhannes A.1 (AUTHOR) haruty@cs.concordia.ca
Source: Discrete Applied Mathematics. Aug2026, Vol. 389, p254-266. 13p.
Subjects: Graph theory, Logarithms
Abstract: Knödel graphs with an even number of vertices play a pivotal role in the construction of various broadcast graphs, with both an odd and even number of vertices. The effectiveness of these constructions depends on the chosen broadcast scheme. Dimensional broadcast schemes are commonly utilized for broadcasting Knödel graphs. This paper identifies several valid dimensional broadcast schemes by investigating standard and reverse schemes. Specifically, considering G as a Knödel graph on n vertices and k = ⌈ log n ⌉ , we investigate the effects of c cyclic shifts on both standard and reverse dimensional broadcast schemes of G , where 0 ≤ c ≤ k − 2 , with the repetition of an arbitrary dimension. [ABSTRACT FROM AUTHOR]
Copyright of Discrete Applied Mathematics is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:Knödel graphs with an even number of vertices play a pivotal role in the construction of various broadcast graphs, with both an odd and even number of vertices. The effectiveness of these constructions depends on the chosen broadcast scheme. Dimensional broadcast schemes are commonly utilized for broadcasting Knödel graphs. This paper identifies several valid dimensional broadcast schemes by investigating standard and reverse schemes. Specifically, considering G as a Knödel graph on n vertices and k = ⌈ log n ⌉ , we investigate the effects of c cyclic shifts on both standard and reverse dimensional broadcast schemes of G , where 0 ≤ c ≤ k − 2 , with the repetition of an arbitrary dimension. [ABSTRACT FROM AUTHOR]
ISSN:0166218X
DOI:10.1016/j.dam.2026.04.002