γ-Labeling of a cycle with one chord

Please use this identifier to cite or link to this item: https://ir.swu.ac.th/jspui/handle/123456789/13513

Full metadata record

DC Field	Value	Language
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.identifier.issn	3029743
dc.identifier.other	2-s2.0-85006055520
dc.identifier.uri	https://ir.swu.ac.th/jspui/handle/123456789/13513	-
dc.identifier.uri	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
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.subject	Computational geometry
dc.subject	Cycle with one chord
dc.subject	Edge labeling
dc.subject	Minimum value
dc.subject	Graph theory
dc.title	γ-Labeling of a cycle with one chord
dc.type	Conference Paper
dc.rights.holder	Scopus
dc.identifier.bibliograpycitation	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
Appears in Collections:	Scopus 1983-2021

Files in This Item:

There are no files associated with this item.