E-resources
Peer reviewed
Open access
-
Busakorn, Aiewcharoen; Boonklurb, Ratinan; Promvichitkul, Sakulwat
Proyecciones (Antofagasta), 10/2022, Volume: 41, Issue: 5Journal Article
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.
