SCOPUS
0Citation Export
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Kang, Bumtle | - |
| dc.contributor.author | Kim, Suh Ryung | - |
| dc.contributor.author | Park, Boram | - |
| dc.date.issued | 2018-10-01 | - |
| dc.identifier.uri | https://dspace.ajou.ac.kr/dev/handle/2018.oak/30450 | - |
| dc.description.abstract | Fujita et al. [3] introduced the notions of safe number and connected safe number in connection with a variation of the facility location problem. In this paper, we compute the safe number and the connected safe number of Cartesian product of two complete graphs, keywords. Safe set; Connected safe set; Safe number; Connected safe number; Cartesian product; Complete graph. | - |
| dc.description.sponsorship | The work by the first author and the second author was supported by the National Research Foundation of Korea (NRF) funded by the Korea government (MEST) (NRF-2015R1A2A2A01006885) and by the Korea government(MSIP) (NRF-2016R1A5A1008055). The third author's work was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Science, ICT & Future Planning (NRF-2015R1C1A1A01053495). | - |
| dc.language.iso | eng | - |
| dc.publisher | Charles Babbage Research Centre | - |
| dc.title | On safe sets of the Cartesian product of two complete graphs | - |
| dc.type | Article | - |
| dc.citation.endPage | 257 | - |
| dc.citation.startPage | 243 | - |
| dc.citation.title | Ars Combinatoria | - |
| dc.citation.volume | 141 | - |
| dc.identifier.bibliographicCitation | Ars Combinatoria, Vol.141, pp.243-257 | - |
| dc.identifier.scopusid | 2-s2.0-85056148041 | - |
| dc.identifier.url | http://www.combinatorialmath.ca/ArsCombinatoria/index.html | - |
| dc.subject.subarea | Mathematics (all) | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
