Global distribution center number of some graphs and an algorithm
| dc.authorid | Kutucu, Hakan/0000-0001-7144-7246 | |
| dc.authorid | TURACI, TUFAN/0000-0002-6159-0935 | |
| dc.contributor.author | Durgut, Rafet | |
| dc.contributor.author | Kutucu, Hakan | |
| dc.contributor.author | Turaci, Tufan | |
| dc.date.accessioned | 2024-09-29T16:01:09Z | |
| dc.date.available | 2024-09-29T16:01:09Z | |
| dc.date.issued | 2019 | |
| dc.department | Karabük Üniversitesi | en_US |
| dc.description.abstract | The global center is a newly proposed graph concept. For a graph G = (V(G), E(G)), a set S subset of V(G) is a global distribution center if every vertex v is an element of V(G)\S is adjacent to a vertex u is an element of S with |N[u] boolean AND S| >= |N[v] boolean AND (V(G)\S)|, where N(v) = {u is an element of V(G)|uv is an element of E(G)} and N[v] = N(v) ? {v}. The global distribution center number of a graph G is the minimum cardinality of a global distribution center of G. In this paper, we investigate the global distribution center number for special families of graphs. Furthermore, we develop a polynomial time heuristic algorithm to find the set of the global distribution center for general graphs. | en_US |
| dc.identifier.doi | 10.1051/ro/2018119 | |
| dc.identifier.endpage | 1227 | en_US |
| dc.identifier.issn | 0399-0559 | |
| dc.identifier.issn | 1290-3868 | |
| dc.identifier.issue | 4 | en_US |
| dc.identifier.scopus | 2-s2.0-85070212800 | en_US |
| dc.identifier.scopusquality | Q3 | en_US |
| dc.identifier.startpage | 1217 | en_US |
| dc.identifier.uri | https://doi.org/10.1051/ro/2018119 | |
| dc.identifier.uri | https://hdl.handle.net/20.500.14619/5544 | |
| dc.identifier.volume | 53 | en_US |
| dc.identifier.wos | WOS:000506012200008 | en_US |
| dc.identifier.wosquality | Q4 | en_US |
| dc.indekslendigikaynak | Web of Science | en_US |
| dc.indekslendigikaynak | Scopus | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | Edp Sciences S A | en_US |
| dc.relation.ispartof | Rairo-Operations Research | en_US |
| dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
| dc.rights | info:eu-repo/semantics/closedAccess | en_US |
| dc.subject | Network design and communication | en_US |
| dc.subject | complex networks | en_US |
| dc.subject | distribution centers | en_US |
| dc.subject | global distribution center number | en_US |
| dc.subject | trees | en_US |
| dc.title | Global distribution center number of some graphs and an algorithm | en_US |
| dc.type | Article | en_US |
