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

Ekinci, Gulnaz Boruzanli; Bujtas, Csilla

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:zenodo.org:4761</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">Let k be a positive integer and let G be a graph with vertex set V(G). A subset D subset of V(G) is a k-dominating set if every vertex outside D is adjacent to at least k vertices in D. The k-domination number gamma(k)(G) is the minimum cardinality of a k-dominating set in G. For any graph G, we know that gamma(k)(G) &amp;gt;= gamma(G) + k - 2 where Delta(G) &amp;gt;= k &amp;gt;= 2 and this bound is sharp for every k &amp;gt;= 2. In this paper, we characterize bipartite graphs satisfying the equality for k &amp;gt;= 3 and present a necessary and sufficient condition for a bipartite graph to satisfy the equality hereditarily when k = 3. We also prove that the problem of deciding whether a graph satisfies the given equality is NP-hard in general.</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">Ekinci, Gulnaz Boruzanli</subfield>
    <subfield code="u">Univ Ljubljana, Fac Math &amp; Phys, Ljubljana, Slovenia</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="z">md5:0b7998cfda7feb8ced612d512c601072</subfield>
    <subfield code="s">133</subfield>
    <subfield code="u">https://aperta.ulakbim.gov.trrecord/4761/files/bib-2d896f8c-22df-4e42-8244-709ead189c8b.txt</subfield>
  </datafield>
  <controlfield tag="005">20210315060301.0</controlfield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="c">2020-01-01</subfield>
  </datafield>
  <datafield tag="024" ind1=" " ind2=" ">
    <subfield code="a">10.1515/math-2020-0047</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">Bipartite graphs with close domination and k-domination numbers</subfield>
  </datafield>
  <datafield tag="909" ind1="C" ind2="4">
    <subfield code="v">18</subfield>
    <subfield code="c">873-885</subfield>
    <subfield code="p">OPEN MATHEMATICS</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">Bujtas, Csilla</subfield>
    <subfield code="u">Ege Univ, Dept Math, TR-35100 Izmir, Turkey</subfield>
  </datafield>
  <controlfield tag="001">4761</controlfield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">user-tubitak-destekli-proje-yayinlari</subfield>
  </datafield>
</record>