Please use this identifier to cite or link to this item: https://ir.swu.ac.th/jspui/handle/123456789/13513
ชื่อเรื่อง: γ-Labeling of a cycle with one chord
ผู้แต่ง: Saduakdee S.
Khemmani V.
Keywords: Computational geometry
Cycle with one chord
Edge labeling
Minimum value
Graph theory
วันที่เผยแพร่: 2016
บทคัดย่อ: 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.
URI: https://ir.swu.ac.th/jspui/handle/123456789/13513
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
ISSN: 3029743
Appears in Collections:Scopus 1983-2021

Files in This Item:
There are no files associated with this item.


Items in SWU repository are protected by copyright, with all rights reserved, unless otherwise indicated.