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

Ekinci, Gulnaz Boruzanli; Bujtas, Csilla

Dublin Core

<?xml version='1.0' encoding='utf-8'?>
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:creator>Ekinci, Gulnaz Boruzanli</dc:creator>
  <dc:creator>Bujtas, Csilla</dc:creator>
  <dc:date>2020-01-01</dc:date>
  <dc:description>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) &gt;= gamma(G) + k - 2 where Delta(G) &gt;= k &gt;= 2 and this bound is sharp for every k &gt;= 2. In this paper, we characterize bipartite graphs satisfying the equality for k &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.</dc:description>
  <dc:identifier>https://aperta.ulakbim.gov.trrecord/4761</dc:identifier>
  <dc:identifier>oai:zenodo.org:4761</dc:identifier>
  <dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
  <dc:rights>http://www.opendefinition.org/licenses/cc-by</dc:rights>
  <dc:source>OPEN MATHEMATICS 18 873-885</dc:source>
  <dc:title>Bipartite graphs with close domination and k-domination numbers</dc:title>
  <dc:type>info:eu-repo/semantics/article</dc:type>
  <dc:type>publication-article</dc:type>
</oai_dc:dc>