Results 1 to 10 of about 1,046 (212)

Locating and Identifying Codes in Circulant Graphs

Discrete Dynamics in Nature and Society, 2021
Identifying and locating-dominating codes have been studied widely in circulant graphs. Recently, Ville Junnila et al. (Optimal bounds on codes for location in circulant graphs, Cryptography and Communications; 2019) studied identifying and locating ...
Shu Jiao Song, Weiqian Zhang, Can Xu
doaj   +2 more sources

Achromatic Numbers for Circulant Graphs and Digraphs

Discussiones Mathematicae Graph Theory, 2021
In this paper, we determine the achromatic and diachromatic numbers of some circulant graphs and digraphs each one with two lengths and give bounds for other circulant graphs and digraphs with two lengths.
Araujo-Pardo Gabriela, Montellano-Ballesteros Juan José, Olsen Mika, Rubio-Montiel Christian   +3 more
doaj   +2 more sources

The Regularity of Some Families of Circulant Graphs

Mathematics, 2019
We compute the Castelnuovo−Mumford regularity of the edge ideals of two families of circulant graphs, which includes all cubic circulant graphs.
Adam Van Tuyl, Van Tuyl Adam
exaly   +3 more sources

The local vertex anti-magic coloring for certain graph operations [PDF]

Heliyon
This work proves the local vertex anti-magic coloring of even regular circulant bipartite graphs C(m;L). Let G be either Kr,r or Kr,r−F, F is a 1-factor.
L. Uma, G. Rajasekaran
doaj   +2 more sources

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

Algorithms, 2022
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 practical uses, including as the foundation for optical networks, discrete ...
Ahmed El-Mesady, Aleksandr Y. Romanov, Aleksandr A. Amerikanov, Alexander D. Ivannikov   +3 more
doaj   +1 more source

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

Alexandria Engineering Journal, 2022
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 complex systems, especially in computer sciences. Applications of graph theory
A. El-Mesady, Omar Bazighifan, Qasem Al-Mdallal   +2 more
doaj   +1 more source

The Dataset for Optimal Circulant Topologies

Big Data and Cognitive Computing, 2023
This article presents software for the synthesis of circulant graphs and the dataset obtained. An algorithm and new methods, which increase the speed of finding optimal circulant topologies, are proposed.
Aleksandr Romanov
doaj   +1 more source

On the decomposition of circulant graphs using algorithmic approaches

Alexandria Engineering Journal, 2022
Many structural models in chemistry, biology, computer science, sociology, and operations research can be analyzed using graph theory. Some examples of these structure models are species movement between regions, molecular bonds, shortest spanning trees,
A. El-Mesady, Y.S. Hamed, H. Shabana
doaj   +1 more source

The minimal and maximal energies of all cubic circulant graphs

AKCE International Journal of Graphs and Combinatorics, 2021
In recent article, Zhou and Zhou conjectured that among cubic circulant graphs with n vertices the maximum energy occurs whenever the largest number of components is attained.
Ilhan Hacioglu, Alper Bulut, Kerem Kaskaloglu   +2 more
doaj   +1 more source

Domination in Cayley graphs: A survey

AKCE International Journal of Graphs and Combinatorics, 2019
Let be a symmetric generating set of a finite group . Assume that be such that and satisfies the two conditions : the identity element and : if , then Given satisfying and define a Cayley graph with and .
T. Tamizh Chelvam, M. Sivagami
doaj   +2 more sources