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

Das, Kinkar C.; Cevik, Ahmet S.; Cangul, Ismail N.

JSON

{
  "conceptrecid": "14496", 
  "created": "2021-03-15T08:21:21.931373+00:00", 
  "doi": "10.1186/1029-242X-2013-395", 
  "files": [
    {
      "bucket": "b4301d22-e6f7-4594-a97d-c2383e06f013", 
      "checksum": "md5:57c075d6a322f3692669ef80aaaca846", 
      "key": "bib-5c886544-a866-43f8-b2cd-a8c199d75679.txt", 
      "links": {
        "self": "https://aperta.ulakbim.gov.tr/api/files/b4301d22-e6f7-4594-a97d-c2383e06f013/bib-5c886544-a866-43f8-b2cd-a8c199d75679.txt"
      }, 
      "size": 122, 
      "type": "txt"
    }
  ], 
  "id": 14497, 
  "links": {
    "badge": "https://aperta.ulakbim.gov.tr/badge/doi/10.1186/1029-242X-2013-395.svg", 
    "bucket": "https://aperta.ulakbim.gov.tr/api/files/b4301d22-e6f7-4594-a97d-c2383e06f013", 
    "doi": "https://doi.org/10.1186/1029-242X-2013-395", 
    "html": "https://aperta.ulakbim.gov.tr/record/14497", 
    "latest": "https://aperta.ulakbim.gov.tr/api/records/14497", 
    "latest_html": "https://aperta.ulakbim.gov.tr/record/14497"
  }, 
  "metadata": {
    "access_right": "open", 
    "access_right_category": "success", 
    "communities": [
      {
        "id": "tubitak-destekli-proje-yayinlari"
      }
    ], 
    "creators": [
      {
        "affiliation": "Sungkyunkwan Univ, Dept Math, Suwon 440746, South Korea", 
        "name": "Das, Kinkar C."
      }, 
      {
        "affiliation": "Selcuk Univ, Fac Sci, Dept Math, TR-42075 Campus, Konya, Turkey", 
        "name": "Cevik, Ahmet S."
      }, 
      {
        "affiliation": "Uludag Univ, Fac Arts & Sci, Dept Math, TR-16059 Bursa, Turkey", 
        "name": "Cangul, Ismail N."
      }
    ], 
    "description": "Let G be a simple connected graph of order n, m edges, maximum degree Delta(1) and minimum degree delta. Li et al. (Appl. Math. Lett. 23: 286-290, 2010) gave an upper bound on number of spanning trees of a graph in terms of n, m, Delta(1) and delta:", 
    "doi": "10.1186/1029-242X-2013-395", 
    "has_grant": false, 
    "journal": {
      "title": "JOURNAL OF INEQUALITIES AND APPLICATIONS"
    }, 
    "license": {
      "id": "cc-by"
    }, 
    "publication_date": "2013-01-01", 
    "relations": {
      "version": [
        {
          "count": 1, 
          "index": 0, 
          "is_last": true, 
          "last_child": {
            "pid_type": "recid", 
            "pid_value": "14497"
          }, 
          "parent": {
            "pid_type": "recid", 
            "pid_value": "14496"
          }
        }
      ]
    }, 
    "resource_type": {
      "subtype": "article", 
      "title": "Dergi makalesi", 
      "type": "publication"
    }, 
    "title": "The number of spanning trees of a graph"
  }, 
  "owners": [
    1
  ], 
  "revision": 1, 
  "stats": {
    "downloads": 7.0, 
    "unique_downloads": 7.0, 
    "unique_views": 43.0, 
    "version_downloads": 7.0, 
    "version_unique_downloads": 7.0, 
    "version_unique_views": 40.0, 
    "version_views": 46.0, 
    "version_volume": 854.0, 
    "views": 50.0, 
    "volume": 854.0
  }, 
  "updated": "2021-03-15T08:21:21.973458+00:00"
}