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

Topcu, Hatice; Sorgun, Sezer; Haemers, Willem H.

JSON

{
  "conceptrecid": "70740", 
  "created": "2021-03-16T03:19:37.397394+00:00", 
  "doi": "10.1016/j.dam.2018.10.002", 
  "files": [
    {
      "bucket": "02cc6936-0000-40a2-9b35-438dba6e32eb", 
      "checksum": "md5:db3dc079d04c4507f908687c91460dd2", 
      "key": "bib-19c8f5f1-ad39-4cb9-80b9-df202bee70bb.txt", 
      "links": {
        "self": "https://aperta.ulakbim.gov.tr/api/files/02cc6936-0000-40a2-9b35-438dba6e32eb/bib-19c8f5f1-ad39-4cb9-80b9-df202bee70bb.txt"
      }, 
      "size": 139, 
      "type": "txt"
    }
  ], 
  "id": 70741, 
  "links": {
    "badge": "https://aperta.ulakbim.gov.tr/badge/doi/10.1016/j.dam.2018.10.002.svg", 
    "bucket": "https://aperta.ulakbim.gov.tr/api/files/02cc6936-0000-40a2-9b35-438dba6e32eb", 
    "doi": "https://doi.org/10.1016/j.dam.2018.10.002", 
    "html": "https://aperta.ulakbim.gov.tr/record/70741", 
    "latest": "https://aperta.ulakbim.gov.tr/api/records/70741", 
    "latest_html": "https://aperta.ulakbim.gov.tr/record/70741"
  }, 
  "metadata": {
    "access_right": "open", 
    "access_right_category": "success", 
    "communities": [
      {
        "id": "tubitak-destekli-proje-yayinlari"
      }
    ], 
    "creators": [
      {
        "affiliation": "Nevsehir Haci Bektas Veli Univ, Dept Math, Nevsehir, Turkey", 
        "name": "Topcu, Hatice"
      }, 
      {
        "name": "Sorgun, Sezer"
      }, 
      {
        "affiliation": "Tilburg Univ, Dept Econometr & OR, Tilburg, Netherlands", 
        "name": "Haemers, Willem H."
      }
    ], 
    "description": "The pineapple graph K-p(q) is obtained by appending q pendant edges to a vertex of a complete graph K-p (p >= 3, q >= 1). We prove that among connected graphs, the pineapple graph is determined by its adjacency spectrum. Moreover, we determine all disconnected graphs which are cospectral with a pineapple graph. Thus we find for which values of p and q the pineapple graph K-p(q) is determined by its adjacency spectrum. The main tool is a recent classification of all graphs with all but three eigenvalues equal to 0 or -1 by the third author. (C) 2018 Elsevier B.V. All rights reserved.", 
    "doi": "10.1016/j.dam.2018.10.002", 
    "has_grant": false, 
    "journal": {
      "pages": "52-59", 
      "title": "DISCRETE APPLIED MATHEMATICS", 
      "volume": "269"
    }, 
    "license": {
      "id": "cc-by"
    }, 
    "publication_date": "2019-01-01", 
    "relations": {
      "version": [
        {
          "count": 1, 
          "index": 0, 
          "is_last": true, 
          "last_child": {
            "pid_type": "recid", 
            "pid_value": "70741"
          }, 
          "parent": {
            "pid_type": "recid", 
            "pid_value": "70740"
          }
        }
      ]
    }, 
    "resource_type": {
      "subtype": "article", 
      "title": "Dergi makalesi", 
      "type": "publication"
    }, 
    "title": "The graphs cospectral with the pineapple graph"
  }, 
  "owners": [
    1
  ], 
  "revision": 1, 
  "stats": {
    "downloads": 7.0, 
    "unique_downloads": 7.0, 
    "unique_views": 54.0, 
    "version_downloads": 7.0, 
    "version_unique_downloads": 7.0, 
    "version_unique_views": 54.0, 
    "version_views": 62.0, 
    "version_volume": 973.0, 
    "views": 62.0, 
    "volume": 973.0
  }, 
  "updated": "2021-03-16T03:19:37.442826+00:00"
}