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

Ekinci, Gulnaz Boruzanli; Bujtas, Csilla

JSON-LD (schema.org)

{
  "@context": "https://schema.org/", 
  "@id": 4761, 
  "@type": "ScholarlyArticle", 
  "creator": [
    {
      "@type": "Person", 
      "affiliation": "Univ Ljubljana, Fac Math & Phys, Ljubljana, Slovenia", 
      "name": "Ekinci, Gulnaz Boruzanli"
    }, 
    {
      "@type": "Person", 
      "affiliation": "Ege Univ, Dept Math, TR-35100 Izmir, Turkey", 
      "name": "Bujtas, Csilla"
    }
  ], 
  "datePublished": "2020-01-01", 
  "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) >= gamma(G) + k - 2 where Delta(G) >= k >= 2 and this bound is sharp for every k >= 2. In this paper, we characterize bipartite graphs satisfying the equality for k >= 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.", 
  "headline": "Bipartite graphs with close domination and k-domination numbers", 
  "identifier": 4761, 
  "image": "https://aperta.ulakbim.gov.tr/static/img/logo/aperta_logo_with_icon.svg", 
  "license": "http://www.opendefinition.org/licenses/cc-by", 
  "name": "Bipartite graphs with close domination and k-domination numbers", 
  "url": "https://aperta.ulakbim.gov.tr/record/4761"
}