Combination labelings of graphs related to several cycles and paths
DOI:
https://doi.org/10.22199/issn.0717-6279-5250Keywords:
graph labeling, combinatorial labeling, cycle, pathAbstract
Suppose that G = (V (G), E(G)) is a graph and |V (G)| = p. If there exists a bijective function f : V (G) → {1, 2, 3, ..., p} such that an f c : E(G) → N defined by f c(uv) = (f(u)f(v))when f (u) > f(v) and f c(uv) = (f(u)f(v))when f (v) > f (u) is an injection function, then f is called a combination labelings and G is called a combination graph.
This article considers a suitable bijective function f and prove that G(Cn, Cm, Pk) which are graphs related to two cycles and one path containing three parameters, are combination graphs.
References
J. A. Gallian, “A dynamic survey of graph labelings”, The Electronic Journal of Combinatorics, vol. 16, 2009.
M. S. Hegde and S. Shetty, “Combinatorial labelings of graphs”, Applied Mathematics E-note, vol. 6, pp. 251-258, 2006.
P. C. Li, “Combination labelings of graphs”, Applied Mathematics E-note, vol. 12, pp. 158-168, 2012. [On line]. Available: https://bit.ly/3AuNvns
K. Thitiwatthanakan and S. Leeratanavalee, “Combinatorial Labelings of Generalized Petersen Graphs and Lollipop Graphs for Some Cases”, Srinakharinwirot Science Journal, vol. 33, no. 2, pp. 195-212, 2017.
Published
How to Cite
Issue
Section
Copyright (c) 2022 Aiewcharoen Busakorn, Ratinan Boonklurb, Sakulwat Promvichitkul
This work is licensed under a Creative Commons Attribution 4.0 International License.
-
Attribution — You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
