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

Ekinci, Gulnaz Boruzanli; Bujtas, Csilla

JSON

{
  "conceptrecid": "4760", 
  "created": "2021-03-15T06:03:01.766177+00:00", 
  "doi": "10.1515/math-2020-0047", 
  "files": [
    {
      "bucket": "2be1894f-f972-4f67-91d3-676f517edb90", 
      "checksum": "md5:0b7998cfda7feb8ced612d512c601072", 
      "key": "bib-2d896f8c-22df-4e42-8244-709ead189c8b.txt", 
      "links": {
        "self": "https://aperta.ulakbim.gov.tr/api/files/2be1894f-f972-4f67-91d3-676f517edb90/bib-2d896f8c-22df-4e42-8244-709ead189c8b.txt"
      }, 
      "size": 133, 
      "type": "txt"
    }
  ], 
  "id": 4761, 
  "links": {
    "badge": "https://aperta.ulakbim.gov.tr/badge/doi/10.1515/math-2020-0047.svg", 
    "bucket": "https://aperta.ulakbim.gov.tr/api/files/2be1894f-f972-4f67-91d3-676f517edb90", 
    "doi": "https://doi.org/10.1515/math-2020-0047", 
    "html": "https://aperta.ulakbim.gov.tr/record/4761", 
    "latest": "https://aperta.ulakbim.gov.tr/api/records/4761", 
    "latest_html": "https://aperta.ulakbim.gov.tr/record/4761"
  }, 
  "metadata": {
    "access_right": "open", 
    "access_right_category": "success", 
    "communities": [
      {
        "id": "tubitak-destekli-proje-yayinlari"
      }
    ], 
    "creators": [
      {
        "affiliation": "Univ Ljubljana, Fac Math & Phys, Ljubljana, Slovenia", 
        "name": "Ekinci, Gulnaz Boruzanli"
      }, 
      {
        "affiliation": "Ege Univ, Dept Math, TR-35100 Izmir, Turkey", 
        "name": "Bujtas, Csilla"
      }
    ], 
    "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.", 
    "doi": "10.1515/math-2020-0047", 
    "has_grant": false, 
    "journal": {
      "pages": "873-885", 
      "title": "OPEN MATHEMATICS", 
      "volume": "18"
    }, 
    "license": {
      "id": "cc-by"
    }, 
    "publication_date": "2020-01-01", 
    "relations": {
      "version": [
        {
          "count": 1, 
          "index": 0, 
          "is_last": true, 
          "last_child": {
            "pid_type": "recid", 
            "pid_value": "4761"
          }, 
          "parent": {
            "pid_type": "recid", 
            "pid_value": "4760"
          }
        }
      ]
    }, 
    "resource_type": {
      "subtype": "article", 
      "title": "Dergi makalesi", 
      "type": "publication"
    }, 
    "title": "Bipartite graphs with close domination and k-domination numbers"
  }, 
  "owners": [
    1
  ], 
  "revision": 1, 
  "stats": {
    "downloads": 10.0, 
    "unique_downloads": 10.0, 
    "unique_views": 65.0, 
    "version_downloads": 10.0, 
    "version_unique_downloads": 10.0, 
    "version_unique_views": 65.0, 
    "version_views": 72.0, 
    "version_volume": 1330.0, 
    "views": 72.0, 
    "volume": 1330.0
  }, 
  "updated": "2021-03-15T06:03:01.813918+00:00"
}