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ę "signed domatic number" wg kryterium: Wszystkie pola

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-4 z 4
    Tytuł:
    Signed domination and signed domatic numbers of digraphs
    Autorzy:
    Volkmann, Lutz
    Powiązania:
    https://bibliotekanauki.pl/articles/743935.pdf
    Data publikacji:
    2011
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    digraph
    oriented graph
    signed dominating function
    signed domination number
    signed domatic number
    Opis:
    Let D be a finite and simple digraph with the vertex set V(D), and let f:V(D) → {-1,1} be a two-valued function. If $∑_{x ∈ N¯[v]}f(x) ≥ 1$ for each v ∈ V(D), where N¯[v] consists of v and all vertices of D from which arcs go into v, then f is a signed dominating function on D. The sum f(V(D)) is called the weight w(f) of f. The minimum of weights w(f), taken over all signed dominating functions f on D, is the signed domination number $γ_S(D)$ of D. A set ${f₁,f₂,...,f_d}$ of signed dominating functions on D with the property that $∑_{i = 1}^d f_i(x) ≤ 1$ for each x ∈ V(D), is called a signed dominating family (of functions) on D. The maximum number of functions in a signed dominating family on D is the signed domatic number of D, denoted by $d_S(D)$. In this work we show that $4-n ≤ γ_S(D) ≤ n$ for each digraph D of order n ≥ 2, and we characterize the digraphs attending the lower bound as well as the upper bound. Furthermore, we prove that $γ_S(D) + d_S(D) ≤ n + 1$ for any digraph D of order n, and we characterize the digraphs D with $γ_S(D) + d_S(D) = n + 1$. Some of our theorems imply well-known results on the signed domination number of graphs.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2011, 31, 3; 415-427
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Signed star (k, k)-domatic number of a graph
    Autorzy:
    Sheikholeslami, S. M.
    Volkmann, L.
    Powiązania:
    https://bibliotekanauki.pl/articles/254927.pdf
    Data publikacji:
    2014
    Wydawca:
    Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
    Tematy:
    signed star (k, k)-domatic number
    signed star domatic number
    signed star k-dominating function
    signed star dominating function
    signed star k-domination number
    signed star domination number
    regular graphs
    Opis:
    Let G be a simple graph without isolated vertices with vertex set V (G) and edge set E(G) and let k be a positive integer. A function ƒ: E(G) →{−1, 1} is said to be a signed star k-dominating function on [formula] for every vertex v of G, where E(v) = {uv ∈ E(G) | u ∈ N(v)}. A set {f1, f2, . . . , fd} of signed star k-dominating functions on G with the property that [formula] for each e ∈ E(G) is called a signed star (k, k)-dominating family (of functions) on G. The maximum number of functions in a signed star (k, k)-dominating family on G is the signed star (k, k)-domatic number of G, denoted by [formula]. In this paper we study properties of the signed star (k, k)-domatic number [formula]. In particular, we present bounds on [formula], and we determine the signed (k, k)-domatic number of some regular graphs. Some of our results extend these given by Atapour, Sheikholeslami, Ghameslou and Volkmann [Signed star domatic number of a graph, Discrete Appl. Math. 158 (2010), 213–218] for the signed star domatic number.
    Źródło:
    Opuscula Mathematica; 2014, 34, 3; 609-620
    1232-9274
    2300-6919
    Pojawia się w:
    Opuscula Mathematica
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    The Signed Total Roman k-Domatic Number Of A Graph
    Autorzy:
    Volkmann, Lutz
    Powiązania:
    https://bibliotekanauki.pl/articles/31341581.pdf
    Data publikacji:
    2017-11-27
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    signed total Roman k-dominating function
    signed total Roman k-domination number
    signed total Roman k-domatic number
    Opis:
    Let $ k \ge 1 $ be an integer. A signed total Roman $k$-dominating function on a graph $G$ is a function $ f : V (G) \rightarrow {−1, 1, 2} $ such that $ \Sigma_{ u \in N(v) } f(u) \ge k $ for every $ v \in V (G) $, where $ N(v) $ is the neighborhood of $ v $, and every vertex $ u \in V (G) $ for which $ f(u) = −1 $ is adjacent to at least one vertex w for which $ f(w) = 2 $. A set $ { f_1, f_2, . . ., f_d} $ of distinct signed total Roman $k$-dominating functions on $G$ with the property that $ \Sigma_{i=1}^d f_i(v) \le k $ for each $ v \in V (G) $, is called a signed total Roman $k$-dominating family (of functions) on $G$. The maximum number of functions in a signed total Roman $k$-dominating family on $G$ is the signed total Roman $k$-domatic number of $G$, denoted by $ d_{stR}^k (G) $. In this paper we initiate the study of signed total Roman $k$-domatic numbers in graphs, and we present sharp bounds for $ d_{stR}^k (G) $. In particular, we derive some Nordhaus-Gaddum type inequalities. In addition, we determine the signed total Roman $k$-domatic number of some graphs.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2017, 37, 4; 1027-1038
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Upper Bounds on the Signed Total (k, k)-Domatic Number of Graphs
    Autorzy:
    Volkmann, Lutz
    Powiązania:
    https://bibliotekanauki.pl/articles/31339301.pdf
    Data publikacji:
    2015-11-01
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    signed total (k
    k)-domatic number
    signed total k-dominating function
    signed total k-domination number
    regular graphs
    Opis:
    Let $G$ be a graph with vertex set $V (G)$, and let $ f : V (G) \rightarrow {−1, 1}$ be a two-valued function. If $ k \geq 1$ is an integer and \( \sum_{ x \in N(v)} f(x) \geq k \) for each $ v \in V (G) $, where $N(v)$ is the neighborhood of $v$, then $f$ is a signed total $k$-dominating function on $G$. A set ${f_1, f_2, . . ., f_d}$ of distinct signed total k-dominating functions on $G$ with the property that \( \sum_{i=1}^d f_i(x) \leq k \) for each $ x \in V (G)$, is called a signed total ($k$, $k$)-dominating family (of functions) on $G$. The maximum number of functions in a signed total ($k$, $k$)-dominating family on $G$ is the signed total ($k$, $k$)-domatic number of $G$. In this article we mainly present upper bounds on the signed total ($k$, $k$)- domatic number, in particular for regular graphs.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2015, 35, 4; 641-650
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-4 z 4

      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