Results 11 to 20 of about 421,915 (161)
The irregularity strength of circulant graphs [PDF]
Discrete Mathematics, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Baril, Jean-Luc +2 more
openaire +4 more sources
Achromatic Numbers for Circulant Graphs and Digraphs [PDF]
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 +3 more
doaj +2 more sources
Well-covered circulant graphs [PDF]
Discrete Mathematics, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jason I. Brown, Richard Hoshino
openaire +4 more sources
The hyperbolicity constant of infinite circulant graphs [PDF]
Open Mathematics, 2017 If X is a geodesic metric space and x1, x2, x3 ∈ X, a geodesic triangle T = {x1, x2, x3} is the union of the three geodesics [x1x2], [x2x3] and [x3x1] in X.
Rodríguez José M., Sigarreta José M.
doaj +2 more sources
Products of Circulant Graphs Are Metacirculant [PDF]
Journal of Combinatorial Theory, Series B, 2002 Broere and Hattingh studied \(B\)-products of graphs (introduced by Imrich and Izbicki) and proved that the lexicographic product of two circulant graphs is again circulant, but this is not the case with other products. In the present paper any \(B\)-product of two circulant graphs is proved to be a metacirculant graph with parameters that are easily ...
Robin S. Sanders, Sanders, Robin S.
openaire +2 more sources
On magic and supermagic circulant graphs [PDF]
Discrete Mathematics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Semaničová, Andrea
openaire +2 more sources
On Ádám's conjecture for circulant graphs [PDF]
Discrete Mathematics, 1997 The content of this article is analogous to the one of the author's former paper [J. Comb. Theory, Ser. A 72, No. 1, 118-134 (1995; Zbl 0833.05063)]. Now the author proves the reviewer's conjecture in case of an \(n\) (number of vertices) such that \(n/4\) is a square-free odd integer.
Muzychuk, Mikhail, Mikhail Muzychuk
openaire +4 more sources
International Journal of Robust and Nonlinear Control, EarlyView., 2023 Abstract We propose a hierarchical energy management scheme for aggregating Distributed Energy Resources (DERs) for grid flexibility services. To prevent a direct participation of numerous prosumers in the wholesale electricity market, aggregators, as self‐interest agents in our scheme, incentivize prosumers to provide flexibility. We firstly model the
Xiupeng Chen +3 more
wiley +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