Routing algorithms in optimal degree four circulant networks based on relative addressing: Comparative analysis for networks-on-chip

EA Monakhova, OG Monakhov… - IEEE Transactions on …, 2022 - ieeexplore.ieee.org
The solution of the problem of organizing optimal communications in circulant networks of
degree four is considered. For a family of optimal circulant networks with the minimum …

[HTML][HTML] Ring-split: Deadlock-free routing algorithm for circulant networks-on-chip

AY Romanov, NM Myachin, EV Lezhnev, AD Ivannikov… - Micromachines, 2023 - mdpi.com
This article considers the usage of circulant topologies as a promising deadlock-free
topology for networks-on-chip (NoCs). A new high-level model, Newxim, for the exploration …

[HTML][HTML] On infinite circulant-balanced complete multipartite graphs decompositions based on generalized algorithmic approaches

A El-Mesady, O Bazighifan, Q Al-Mdallal - Alexandria Engineering Journal, 2022 - Elsevier
Graph theory is a powerful and essential tool for applied scientists and engineers in
analyzing and designing algorithms for several problems. Graph theory has a vital role in …

Construction of mutually orthogonal graph squares using novel product techniques

A El-Mesady, O Bazighifan - Journal of Mathematics, 2022 - Wiley Online Library
Sets of mutually orthogonal Latin squares prescribe the order in which to apply different
treatments in designing an experiment to permit effective statistical analysis of results, they …

A novel approach for cyclic decompositions of balanced complete bipartite graphs into infinite graph classes

A El-Mesady, O Bazighifan… - Journal of Function …, 2022 - Wiley Online Library
Graph theory is considered an attractive field for finding the proof techniques in discrete
mathematics. The results of graph theory have applications in many areas of social …

[Retracted] Decompositions of Circulant‐Balanced Complete Multipartite Graphs Based on a Novel Labelling Approach

A El-Mesady, O Bazighifan - Journal of Function Spaces, 2022 - Wiley Online Library
For applied scientists and engineers, graph theory is a strong and vital tool for evaluating
and inventing solutions for a variety of issues. Graph theory is extremely important in …

Analysis of zigzag and rhombic benzenoid systems via irregularity indices

M Awais, Z Ahmed, W Khalid… - Journal of …, 2023 - Wiley Online Library
Topological indices are numerical quantities associated with the molecular graph of a
chemical structure. These indices are used to predict various properties of chemical …

[HTML][HTML] On Bipartite Circulant Graph Decompositions Based on Cartesian and Tensor Products with Novel Topologies and Deadlock-Free Routing

A El-Mesady, AY Romanov, AA Amerikanov… - Algorithms, 2022 - mdpi.com
Recent developments in commutative algebra, linear algebra, and graph theory allow us to
approach various issues in several fields. Circulant graphs now have a wider range of …

[PDF][PDF] Ring-Split: Deadlock-Free Routing Algorithm for Circulant Networks-on-Chip. Micromachines 2023, 14, 141

AY Romanov, NM Myachin, EV Lezhnev, AD Ivannikov… - 2023 - academia.edu
This article considers the usage of circulant topologies as a promising deadlock-free
topology for networks-on-chip (NoCs). A new high-level model, Newxim, for the exploration …

UAV Network Channel Allocation Method Based on Bipartite Graph Popular Matching Algorithm

W Li, J Guo - IEEE Access, 2023 - ieeexplore.ieee.org
To address the challenges of selecting task schemes and ensuring secure channels
duringdata collection and transmission by unmanned aerial vehicles, the study divides the …