1 Ocak 2022 Dergi makalesi Açık Erişim

Dettlaff, Magda; Gozupek, Didem; Raczek, Joanna

MARC21 XML

<?xml version='1.0' encoding='UTF-8'?>
<record xmlns="http://www.loc.gov/MARC21/slim">
  <leader>00000nam##2200000uu#4500</leader>
  <datafield tag="909" ind1="C" ind2="O">
    <subfield code="p">user-tubitak-destekli-proje-yayinlari</subfield>
    <subfield code="o">oai:aperta.ulakbim.gov.tr:260723</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">Given a graph G = (V(G), E(G)), the size of a minimum dominating set, minimum paired dominating set, and a minimum total dominating set of a graph G are denoted by gamma(G), gamma(pr) (G), and gamma(t) (G), respectively. For a positive integer k, a k-packing in G is a set S subset of V(G) such that for every pair of distinct vertices u and v in S, the distance between u and v is at least k + 1. The k-packing number is the order of a largest kpacking and is denoted by rho(k) (G). It iswell known that gamma(pr) (G) &amp;lt;= 2 gamma(G). In this paper, we prove that it is NP-hard to determine whether gamma(pr) (G) = 2 gamma (G) even for bipartite graphs. We provide a simple characterization of trees with.pr (G) = 2 gamma (G), implying a polynomial-time recognition algorithm. We also prove that even for a bipartite graph, it is NP-hard to determine whether gamma(pr) (G) = gamma(t) (G). We finally prove that it is both NP-hard to determine whether gamma(pr) (G) = 2 rho(4)( G) and whether gamma(pr) (G) = 2 rho(3)(G).</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">publication</subfield>
    <subfield code="b">article</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
    <subfield code="a">Creative Commons Attribution</subfield>
    <subfield code="u">http://www.opendefinition.org/licenses/cc-by</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="a">Dettlaff, Magda</subfield>
    <subfield code="u">Gdansk Univ Technol, Fac Appl Phys &amp; Math, Gdansk, Poland</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="z">md5:7a48af784d1212ea750adb7e12b872bd</subfield>
    <subfield code="s">167</subfield>
    <subfield code="u">https://aperta.ulakbim.gov.trrecord/260723/files/bib-de1539e4-0dc9-45f0-8ae2-4155a125366f.txt</subfield>
  </datafield>
  <controlfield tag="005">20230729124711.0</controlfield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="c">2022-01-01</subfield>
  </datafield>
  <datafield tag="024" ind1=" " ind2=" ">
    <subfield code="a">10.1007/s10878-022-00873-y</subfield>
    <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="542" ind1=" " ind2=" ">
    <subfield code="l">open</subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">Paired domination versus domination and packing number in graphs</subfield>
  </datafield>
  <datafield tag="909" ind1="C" ind2="4">
    <subfield code="v">44</subfield>
    <subfield code="p">JOURNAL OF COMBINATORIAL OPTIMIZATION</subfield>
    <subfield code="c">921-933</subfield>
    <subfield code="n">2</subfield>
  </datafield>
  <datafield tag="650" ind1="1" ind2="7">
    <subfield code="a">cc-by</subfield>
    <subfield code="2">opendefinition.org</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="a">Gozupek, Didem</subfield>
    <subfield code="u">Gebze Tech Univ, Dept Comp Engn, Kocaeli, Turkey</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="a">Raczek, Joanna</subfield>
    <subfield code="u">Gdansk Univ Technol, Fac Elect Telecommun &amp; Informat, Gdansk, Poland</subfield>
  </datafield>
  <controlfield tag="001">260723</controlfield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">user-tubitak-destekli-proje-yayinlari</subfield>
  </datafield>
</record>