Informacja

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

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "domination number" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-6 z 6
    Tytuł:
    Bounds on the Locating Roman Domination Number in Trees
    Autorzy:
    Jafari Rad, Nader
    Rahbani, Hadi
    Powiązania:
    https://bibliotekanauki.pl/articles/16647912.pdf
    Data publikacji:
    2018-02-01
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    Roman domination number
    locating domination number
    locating Roman domination number
    tree
    Opis:
    A Roman dominating function (or just RDF) on a graph G = (V, E) is a function f : V → {0, 1, 2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v) = 2. The weight of an RDF f is the value f(V (G)) = ∑u∈V(G) f(u). An RDF f can be represented as f = (V0, V1, V2), where Vi = {v ∈ V : f(v) = i} for i = 0, 1, 2. An RDF f = (V0, V1, V2) is called a locating Roman dominating function (or just LRDF) if N(u) ∩ V2 ≠ N(v) ∩ V2 for any pair u, v of distinct vertices of V0. The locating Roman domination number $\gamma _R^L (G)$ is the minimum weight of an LRDF of G. In this paper, we study the locating Roman domination number in trees. We obtain lower and upper bounds for the locating Roman domination number of a tree in terms of its order and the number of leaves and support vertices, and characterize trees achieving equality for the bounds.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2018, 38, 1; 49-62
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Bounds on the Locating Roman Domination Number in Trees
    Autorzy:
    Jafari Rad, Nader
    Rahbani, Hadi
    Powiązania:
    https://bibliotekanauki.pl/articles/31342446.pdf
    Data publikacji:
    2018-02-01
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    Roman domination number
    locating domination number
    locating Roman domination number
    tree
    Opis:
    A Roman dominating function (or just RDF) on a graph $ G = (V, E) $ is a function $ f : V \rightarrow \{ 0, 1, 2 \} $ satisfying the condition that every vertex $u$ for which $ f(u) = 0$ is adjacent to at least one vertex $v$ for which $f(v) = 2$. The weight of an RDF $f$ is the value $ f(V (G)) = \Sigma_{ u \in V (G) } f(u) $. An RDF $f$ can be represented as $ f = (V_0, V_1, V_2) $, where $ V_i = \{ v \in V : f(v) = i \} $ for $ i = 0, 1, 2 $. An RDF $ f = (V_0, V_1, V_2) $ is called a locating Roman dominating function (or just LRDF) if $ N(u) \cap V_2 \ne N(v) \cap V_2 $ for any pair $u$, $v$ of distinct vertices of $ V_0 $. The locating Roman domination number $ \gamma_R^L (G) $ is the minimum weight of an LRDF of $G$. In this paper, we study the locating Roman domination number in trees. We obtain lower and upper bounds for the locating Roman domination number of a tree in terms of its order and the number of leaves and support vertices, and characterize trees achieving equality for the bounds.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2018, 38, 1; 49-62
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A Note on Roman Domination of Digraphs
    Autorzy:
    Chen, Xiaodan
    Hao, Guoliang
    Xie, Zhihong
    Powiązania:
    https://bibliotekanauki.pl/articles/31343785.pdf
    Data publikacji:
    2019-02-01
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    Roman domination number
    domination number
    digraph
    Nordhaus-Gaddum
    Opis:
    A vertex subset $S$ of a digraph $D$ is called a dominating set of $D$ if every vertex not in $S$ is adjacent from at least one vertex in $S$. The domination number of a digraph $D$, denoted by $ \gamma(D) $, is the minimum cardinality of a dominating set of $D$. A Roman dominating function (RDF) on a digraph $D$ is a function $ f : V (D) \rightarrow {0, 1, 2} $ satisfying the condition that every vertex $v$ with $f(v) = 0$ has an in-neighbor $u$ with $f(u) = 2$. The weight of an RDF $f$ is the value $ \omega (f) = \Sigma_{ v \in V(D) } f(v) $. The Roman domination number of a digraph $D$, denoted by $ \gamma_R (D) $, is the minimum weight of an RDF on $D$. In this paper, for any integer $k$ with $ 2 \le k \le \gamma(D) $, we characterize the digraphs $D$ of order $ n \ge 4 $ with $ \delta − (D) \ge 1 $ for which $ \gamma_R(D) = (D) + k $ holds. We also characterize the digraphs $D$ of order $ n \ge k $ with $ \gamma_R(D) = k $ for any positive integer $k$. In addition, we present a Nordhaus-Gaddum bound on the Roman domination number of digraphs.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2019, 39, 1; 13-21
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    On The Roman Domination Stable Graphs
    Autorzy:
    Hajian, Majid
    Rad, Nader Jafari
    Powiązania:
    https://bibliotekanauki.pl/articles/31341613.pdf
    Data publikacji:
    2017-11-27
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    Roman domination number
    bound
    Opis:
    A Roman dominating function (or just RDF) on a graph $ G = (V,E) $ is a function $ f : V \rightarrow \{ 0, 1, 2 \} $ satisfying the condition that every vertex $u$ for which $f(u) = 0$ is adjacent to at least one vertex $v$ for which $f(v) = 2$. The weight of an RDF $f$ is the value $f(V (G)) = \Sigma_{ u \in V(G) } f(u) $. The Roman domination number of a graph $G$, denoted by $ \gamma_R (G)$, is the minimum weight of a Roman dominating function on $G$. A graph $G$ is Roman domination stable if the Roman domination number of $G$ remains unchanged under removal of any vertex. In this paper we present upper bounds for the Roman domination number in the class of Roman domination stable graphs, improving bounds posed in [V. Samodivkin, Roman domination in graphs: the class $ R_{UV R} $, Discrete Math. Algorithms Appl. 8 (2016) 1650049].
    Źródło:
    Discussiones Mathematicae Graph Theory; 2017, 37, 4; 859-871
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    The Distance Roman Domination Numbers of Graphs
    Autorzy:
    Aram, Hamideh
    Norouzian, Sepideh
    Sheikholeslami, Seyed Mahmoud
    Powiązania:
    https://bibliotekanauki.pl/articles/30098151.pdf
    Data publikacji:
    2013-09-01
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    k-distance Roman dominating function
    k-distance Roman domination number
    Roman dominating function
    Roman domination number
    Opis:
    Let $ k $ be a positive integer, and let $ G $ be a simple graph with vertex set $ V (G) $. A k-distance Roman dominating function on $ G $ is a labeling $ f : V (G) → {0, 1, 2} $ such that for every vertex with label 0, there is a vertex with label 2 at distance at most $ k $ from each other. The weight of a $k$-distance Roman dominating function $ f $ is the value $ \omega (f) =∑_{v∈V} f(v) $. The k-distance Roman domination number of a graph $G$, denoted by $\gamma_R^k (D) $, equals the minimum weight of a $k$-distance Roman dominating function on G. Note that the 1-distance Roman domination number $ \gamma_R^1 (G) $ is the usual Roman domination number $ \gamma_R (G) $. In this paper, we investigate properties of the $k$-distance Roman domination number. In particular, we prove that for any connected graph $ G $ of order $ n \geq k +2$, $\gamma_R^k (G) \leq 4n//(2k +3) $ and we characterize all graphs that achieve this bound. Some of our results extend these ones given by Cockayne et al. in 2004 and Chambers et al. in 2009 for the Roman domination number.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2013, 33, 4; 717-730
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Extremal Graphs for a Bound on the Roman Domination Number
    Autorzy:
    Bouchou, Ahmed
    Blidia, Mostafa
    Chellali, Mustapha
    Powiązania:
    https://bibliotekanauki.pl/articles/31513493.pdf
    Data publikacji:
    2020-08-01
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    Roman domination
    Roman domination number
    Nordhaus-Gaddum inequalities
    Opis:
    A Roman dominating function on a graph G = (V, E) is a function f:V (G) → {0, 1, 2} such that every vertex u for which f(u) = 0 is adjacent to at least one vertex v with f(v) = 2. The weight of a Roman dominating function is the value w(f) = Σu∈V(G) f(u). The minimum weight of a Roman dominating function on a graph G is called the Roman domination number of G, denoted by γR(G). In 2009, Chambers, Kinnersley, Prince and West proved that for any graph G with n vertices and maximum degree Δ, γR(G) ≤ n + 1 − Δ. In this paper, we give a characterization of graphs attaining the previous bound including trees, regular and semiregular graphs. Moreover, we prove that the problem of deciding whether γR(G) = n + 1 − Δ is co-complete. Finally, we provide a characterization of extremal graphs of a Nordhaus–Gaddum bound for γR(G) + γR (Ḡ), where Ḡ is the complement graph of G.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2020, 40, 3; 771-785
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-6 z 6

      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