Dergi makalesi Açık Erişim
Bahadir, Selim; Gozupek, Didem
{
"conceptdoi": "10.81043/aperta.35288",
"conceptrecid": "35288",
"created": "2021-03-15T19:20:34.637106+00:00",
"doi": "10.81043/aperta.35289",
"files": [
{
"bucket": "f9387903-bf6a-40c9-8416-6765f27efc82",
"checksum": "md5:316c5283f36aa6f87477c93e6918b429",
"key": "bib-7538a60e-bd95-423a-9b72-6a6e387651c7.txt",
"links": {
"self": "https://aperta.ulakbim.gov.tr/api/files/f9387903-bf6a-40c9-8416-6765f27efc82/bib-7538a60e-bd95-423a-9b72-6a6e387651c7.txt"
},
"size": 152,
"type": "txt"
}
],
"id": 35289,
"links": {
"badge": "https://aperta.ulakbim.gov.tr/badge/doi/10.81043/aperta.35289.svg",
"bucket": "https://aperta.ulakbim.gov.tr/api/files/f9387903-bf6a-40c9-8416-6765f27efc82",
"conceptbadge": "https://aperta.ulakbim.gov.tr/badge/doi/10.81043/aperta.35288.svg",
"conceptdoi": "https://doi.org/10.81043/aperta.35288",
"doi": "https://doi.org/10.81043/aperta.35289",
"html": "https://aperta.ulakbim.gov.tr/record/35289",
"latest": "https://aperta.ulakbim.gov.tr/api/records/35289",
"latest_html": "https://aperta.ulakbim.gov.tr/record/35289"
},
"metadata": {
"access_right": "open",
"access_right_category": "success",
"communities": [
{
"id": "tubitak-destekli-proje-yayinlari"
}
],
"creators": [
{
"affiliation": "Ankara Yildirim Beyazit Univ, Dept Math Comp, Ankara, Turkey",
"name": "Bahadir, Selim"
},
{
"affiliation": "Gebze Tech Univ, Dept Comp Engn, Gebze, Turkey",
"name": "Gozupek, Didem"
}
],
"description": "Let gamma(G) and gamma(t) (G) denote the domination number and the total domination number, respectively, of a graph G with no isolated vertices. It is well-known that gamma(t) (G) <= 2 gamma(G). We provide a characterization of a large family of graphs (including chordal graphs) satisfying gamma(t) (G) = 2 gamma(G), strictly generalizing the results of Henning (2001) and Hou and Xu (2010), and partially answering an open question of Henning (2009).",
"doi": "10.81043/aperta.35289",
"has_grant": false,
"journal": {
"issue": "1",
"title": "DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE",
"volume": "20"
},
"license": {
"id": "cc-by"
},
"publication_date": "2018-01-01",
"related_identifiers": [
{
"identifier": "10.81043/aperta.35288",
"relation": "isVersionOf",
"scheme": "doi"
}
],
"relations": {
"version": [
{
"count": 1,
"index": 0,
"is_last": true,
"last_child": {
"pid_type": "recid",
"pid_value": "35289"
},
"parent": {
"pid_type": "recid",
"pid_value": "35288"
}
}
]
},
"resource_type": {
"subtype": "article",
"title": "Dergi makalesi",
"type": "publication"
},
"title": "On a Class of Graphs with Large Total Domination Number"
},
"owners": [
1
],
"revision": 1,
"stats": {
"downloads": 9.0,
"unique_downloads": 9.0,
"unique_views": 57.0,
"version_downloads": 9.0,
"version_unique_downloads": 9.0,
"version_unique_views": 50.0,
"version_views": 52.0,
"version_volume": 1368.0,
"views": 61.0,
"volume": 1368.0
},
"updated": "2021-03-15T19:20:34.693096+00:00"
}
| Görüntülenme | 61 |
| İndirme | 9 |
| Veri hacmi | 1.4 kB |
| Tekil görüntülenme | 57 |
| Tekil indirme | 9 |