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ę "paired domination" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-7 z 7
    Tytuł:
    The paired-domination and the upper paired-domination numbers of graphs
    Autorzy:
    Ulatowski, W.
    Powiązania:
    https://bibliotekanauki.pl/articles/255585.pdf
    Data publikacji:
    2015
    Wydawca:
    Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
    Tematy:
    paired-domination
    paired-domination number
    upper paired-domination number
    Opis:
    In this paper we continue the study of paired-domination in graphs. A paired-dominating set, abbreviated PDS, of a graph G with no isolated vertex is a dominating set of vertices whose induced subgraph has a perfect matching. The paired-domination number of G, denoted by γP(G), is the minimum cardinality of a PDS of G. The upper paired-domination number of G, denoted by ΓP(G), is the maximum cardinality of a minimal PDS of G. Let G be a connected graph of order n ≥ 3. Haynes and Slater in [Paired-domination in graphs, Networks 32 (1998), 199-206], showed that γ P(G) ≤ n— 1 and they determine the extremal graphs G achieving this bound. In this paper we obtain analogous results for ΓP(G). Dorbec, Henning and McCoy in [Upper total domination versus upper paired-domination, Questiones Mathematicae 30 (2007), 1-12] determine Γp(Pn), instead in this paper we determine Γp(Cn). Moreover, we describe some families of graphs G for which the equality γP(G) = ΓP(G) holds.
    Źródło:
    Opuscula Mathematica; 2015, 35, 1; 127-135
    1232-9274
    2300-6919
    Pojawia się w:
    Opuscula Mathematica
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    All graphs with paired-domination number two less than their order
    Autorzy:
    Ulatowski, W.
    Powiązania:
    https://bibliotekanauki.pl/articles/255220.pdf
    Data publikacji:
    2013
    Wydawca:
    Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
    Tematy:
    paired-domination
    paired-domination number
    Opis:
    Let G = (V,E) be a graph with no isolated vertices. A set S ⊆ V is a paired-dominating set of G if every vertex not in S is adjacent with some vertex in S and the subgraph induced by S contains a perfect matching. The paired-domination number Υρ (G) of G is defined to be the minimum cardinality of a paired-dominating set of G. Let G be a graph of order n. In [Paired-domination in graphs, Networks 32 (1998), 199–206] Haynes and Slater described graphs G with Υρ (G) = n and also graphs with Υρ (G) = n − 1. In this paper we show all graphs for which Υρ (G) = n − 2.
    Źródło:
    Opuscula Mathematica; 2013, 33, 4; 763-783
    1232-9274
    2300-6919
    Pojawia się w:
    Opuscula Mathematica
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Minimal Graphs with Disjoint Dominating and Paired-Dominating Sets
    Autorzy:
    Henning, Michael A.
    Topp, Jerzy
    Powiązania:
    https://bibliotekanauki.pl/articles/32222686.pdf
    Data publikacji:
    2021-08-01
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    domination
    paired-domination
    Opis:
    A subset D ⊆ VG is a dominating set of G if every vertex in VG – D has a neighbor in D, while D is a paired-dominating set of G if D is a dominating set and the subgraph induced by D contains a perfect matching. A graph G is a DPDP -graph if it has a pair (D, P) of disjoint sets of vertices of G such that D is a dominating set and P is a paired-dominating set of G. The study of the DPDP -graphs was initiated by Southey and Henning [Cent. Eur. J. Math. 8 (2010) 459–467; J. Comb. Optim. 22 (2011) 217–234]. In this paper, we provide conditions which ensure that a graph is a DPDP -graph. In particular, we characterize the minimal DPDP -graphs.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2021, 41, 3; 827-847
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Paired-domination
    Autorzy:
    Fitzpatrick, S.
    Hartnell, B.
    Powiązania:
    https://bibliotekanauki.pl/articles/744199.pdf
    Data publikacji:
    1998
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    domination
    paired-domination
    matching
    Opis:
    We are interested in dominating sets (of vertices) with the additional property that the vertices in the dominating set can be paired or matched via existing edges in the graph. This could model the situation of guards or police where each has a partner or backup. This paper will focus on those graphs in which the number of matched pairs of a minimum dominating set of this type equals the size of some maximal matching in the graph. In particular, we characterize the leafless graphs of girth seven or more of this type.
    Źródło:
    Discussiones Mathematicae Graph Theory; 1998, 18, 1; 63-72
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Graphs With Large Semipaired Domination Number
    Autorzy:
    Haynes, Teresa W.
    Henning, Michael A.
    Powiązania:
    https://bibliotekanauki.pl/articles/31343332.pdf
    Data publikacji:
    2019-08-01
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    paired-domination
    semipaired domination
    Opis:
    Let $G$ be a graph with vertex set $V$ and no isolated vertices. A subset $ S \subseteq V $ is a semipaired dominating set of $G$ if every vertex in $ V \backslash S $ is adjacent to a vertex in $S$ and $S$ can be partitioned into two element subsets such that the vertices in each subset are at most distance two apart. The semipaired domination number $ \gamma_{pr2}(G) $ is the minimum cardinality of a semipaired dominating set of $G$. We show that if $G$ is a connected graph $G$ of order $ n \ge 3 $, then \( \gamma_{pr2} (G) \le \tfrac{2}{3} n \), and we characterize the extremal graphs achieving equality in the bound.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2019, 39, 3; 659-671
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Total Domination Versus Paired-Domination in Regular Graphs
    Autorzy:
    Cyman, Joanna
    Dettlaff, Magda
    Henning, Michael A.
    Lemańska, Magdalena
    Raczek, Joanna
    Powiązania:
    https://bibliotekanauki.pl/articles/31342314.pdf
    Data publikacji:
    2018-05-01
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    domination
    total domination
    paired-domination
    Opis:
    A subset S of vertices of a graph G is a dominating set of G if every vertex not in S has a neighbor in S, while S is a total dominating set of G if every vertex has a neighbor in S. If S is a dominating set with the additional property that the subgraph induced by S contains a perfect matching, then S is a paired-dominating set. The domination number, denoted γ(G), is the minimum cardinality of a dominating set of G, while the minimum cardinalities of a total dominating set and paired-dominating set are the total domination number, γt(G), and the paired-domination number, γpr(G), respectively. For k ≥ 2, let G be a connected k-regular graph. It is known [Schaudt, Total domination versus paired domination, Discuss. Math. Graph Theory 32 (2012) 435–447] that γpr(G)/γt(G) ≤ (2k)/(k+1). In the special case when k = 2, we observe that γpr(G)/γt(G) ≤ 4/3, with equality if and only if G ≅ C5. When k = 3, we show that γpr(G)/γt(G) ≤ 3/2, with equality if and only if G is the Petersen graph. More generally for k ≥ 2, if G has girth at least 5 and satisfies γpr(G)/γt(G) = (2k)/(k + 1), then we show that G is a diameter-2 Moore graph. As a consequence of this result, we prove that for k ≥ 2 and k ≠ 57, if G has girth at least 5, then γpr(G)/γt(G) ≤ (2k)/(k +1), with equality if and only if k = 2 and G ≅ C5 or k = 3 and G is the Petersen graph.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2018, 38, 2; 573-586
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Paired- and induced paired-domination in {E,net}-free graphs
    Autorzy:
    Schaudt, Oliver
    Powiązania:
    https://bibliotekanauki.pl/articles/743226.pdf
    Data publikacji:
    2012
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    domination
    paired-domination
    induced paired-domination
    induced matchings
    {E,net}-free graphs
    Opis:
    A dominating set of a graph is a vertex subset that any vertex belongs to or is adjacent to. Among the many well-studied variants of domination are the so-called paired-dominating sets. A paired-dominating set is a dominating set whose induced subgraph has a perfect matching. In this paper, we continue their study.
    We focus on graphs that do not contain the net-graph (obtained by attaching a pendant vertex to each vertex of the triangle) or the E-graph (obtained by attaching a pendant vertex to each vertex of the path on three vertices) as induced subgraphs. This graph class is a natural generalization of {claw, net}-free graphs, which are intensively studied with respect to their nice properties concerning domination and hamiltonicity. We show that any connected {E, net}-free graph has a paired-dominating set that, roughly, contains at most half of the vertices of the graph. This bound is a significant improvement to the known general bounds.
    Further, we show that any {E, net, C₅}-free graph has an induced paired-dominating set, that is a paired-dominating set that forms an induced matching, and that such set can be chosen to be a minimum paired-dominating set. We use these results to obtain a new characterization of {E, net, C₅}-free graphs in terms of the hereditary existence of induced paired-dominating sets. Finally, we show that the induced matching formed by an induced paired-dominating set in a {E, net, C₅}-free graph can be chosen to have at most two times the size of the smallest maximal induced matching possible.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2012, 32, 3; 473-485
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-7 z 7

      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