Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "circulant graphs" wg kryterium: Temat


Wyświetlanie 1-2 z 2
Tytuł:
Achromatic Numbers for Circulant Graphs and Digraphs
Autorzy:
Araujo-Pardo, Gabriela
Montellano-Ballesteros, Juan José
Olsen, Mika
Rubio-Montiel, Christian
Powiązania:
https://bibliotekanauki.pl/articles/32222712.pdf
Data publikacji:
2021-08-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
circulant graphs
complete colorings
achromatic number
achromatic index
Opis:
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. In particular, for the achromatic number we state that $ \alpha (C_{16q^2 + 20q + 7}(1, 2)) = 8q + 5 $, and for the diachromatic number we state that $ dac( \vec{C}_{32q^2 + 24q + 5} (1, 2)) = 8q + 3$. In general, we give the lower bounds $ \alpha(C_{4q^2 + aq+1} (1, a)) \ge 4q + 1$ and $ dac( \vec{C}_{8q^2+2(a+4)q+a+3} (1, a)) \ge 4q + 3 $ when $a$ is a non quadratic residue of $\mathbb{Z}_{4q+1} $ for graphs and $ \mathbb{Z}_{4q+3} $ for digraphs, and the equality is attained, in both cases, for $a = 3$. Finally, we determine the achromatic index for circulant graphs of $ q^2 +q + 1 $ vertices when the projective cyclic plane of odd order $q$ exists.
Źródło:
Discussiones Mathematicae Graph Theory; 2021, 41, 3; 713-724
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Open Locating-Dominating Sets in Circulant Graphs
Autorzy:
Givens, Robin M.
Yu, Gexin
Kincaid, Rex K.
Powiązania:
https://bibliotekanauki.pl/articles/32361753.pdf
Data publikacji:
2022-02-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
open locating-dominating sets
circulant graphs
Hall’s Matching Theorem
mixed-weight open locating-dominating sets
Opis:
Location detection problems have been studied for a variety of applications including finding faults in multiprocessors, contaminants in public utilities, intruders in buildings and facilities, and for environmental monitoring using wireless sensor networks. In each of these applications, the system or structure can be modeled as a graph, and sensors placed strategically at a subset of vertices can locate and detect anomalies in the system. An open locating-dominating set (OLD-set) is a subset of vertices in a graph in which every vertex in the graph has a non-empty and unique set of neighbors in the subset. Sensors placed at OLD-set vertices can uniquely detect and locate disturbances in a system. These sensors can be expensive and, as a result, minimizing the size of the OLD-set is critical. Circulant graphs, a group of regular cyclic graphs, are often used to model parallel networks. We prove the optimal OLD-set size for a particular circulant graph using Hall’s Theorem. We also consider the mixed-weight OLD-set introduced in [R.M. Givens, R.K. Kincaid, W. Mao and G. Yu, Mixed-weight open locating-dominating sets, in: 2017 Annual Conference on Information Science and Systems, (IEEE, Baltimor, 2017) 1–6] which models a system with sensors of varying strengths. To model these systems, we place weights on the vertices in the graph, representing the strength of a sensor placed at the corresponding location in the system. We study particular mixed-weight OLD-sets in cycles, which behave similarly to OLD-sets in circulant graphs, and show the optimal mixed-weight OLD-set size using the discharging method.
Źródło:
Discussiones Mathematicae Graph Theory; 2022, 42, 1; 47-62
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-2 z 2

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies