Publication: γ-Labeling of a cycle with one chord
| dc.contributor.author | Saduakdee S. | |
| dc.contributor.author | Khemmani V. | |
| dc.date.accessioned | 2021-04-05T03:24:22Z | |
| dc.date.available | 2021-04-05T03:24:22Z | |
| dc.date.issued | 2016 | |
| dc.date.issuedBE | 2559 | |
| dc.description.abstract | Let G be a graph of order n and size m. A γ-labeling of G is a one-to-one function f: V (G) → {0, 1, 2, …, m} that induces an edge-labeling f':E(G) → {1,2,…,M on G defined by(Formula presented) In this paper, we determine the maximum and minimum values of a γ-labeling of a graph derived from cycle with adding one chord. © Springer International Publishing AG 2016. | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.citation | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol 9943 LNCS, (2016), p.155-166 | |
| dc.identifier.doi | 10.1007/978-3-319-48532-4_14 | |
| dc.identifier.issn | 3029743 | |
| dc.identifier.other | 2-s2.0-85006055520 | |
| dc.identifier.uri | https://hdl.handle.net/20.500.14740/5812 | |
| dc.rights.holder | มหาวิทยาลัยศรีนครินทรวิโรฒ | |
| dc.subject.other | Computational geometry | |
| dc.subject.other | Cycle with one chord | |
| dc.subject.other | Edge labeling | |
| dc.subject.other | Minimum value | |
| dc.subject.other | Graph theory | |
| dc.title | γ-Labeling of a cycle with one chord | |
| dc.type | Conference Paper | |
| dspace.entity.type | Publication | |
| swu.datasource.scopus | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85006055520&doi=10.1007%2f978-3-319-48532-4_14&partnerID=40&md5=508236ea8be5d15b99ed6cf33a2bb2f5 |