Publication:
γ-Labeling of a cycle with one chord

0
0

Issued Date

2016

Resource Type

Conference Paper

File Type

application/pdf

ISSN

3029743

DOI

10.1007/978-3-319-48532-4_14

Other identifier(s)

2-s2.0-85006055520

Rights Holder(s)

มหาวิทยาลัยศรีนครินทรวิโรฒ

Bibliographic 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

Suggested Citation

Saduakdee S., Khemmani V. γ-Labeling of a cycle with one chord. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol 9943 LNCS, (2016), p.155-166. doi:10.1007/978-3-319-48532-4_14 Retrieved from: https://hdl.handle.net/20.500.14740/5812

Title

γ-Labeling of a cycle with one chord

Author(s)

Saduakdee S.
 Khemmani V.

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.

Subject(s)

Computational geometry
 Cycle with one chord
 Edge labeling
 Minimum value
 Graph theory

View online Resources

Research Projects

Organizational Units

Journal Issue

URI

https://hdl.handle.net/20.500.14740/5812

Collections

Scopus: Year 1983-2021

Endorsement

Review

Supplemented By

Referenced By