Combination labelings of graphs related to several cycles and paths

• Busakorn, Aiewcharoen ^[1] ; Boonklurb, Ratinan ^[2] ; Promvichitkul, Sakulwat
  1. [1] Silpakorn University

     Silpakorn University

     Tailandia

     
  2. [2] Chulalongkorn University

     Chulalongkorn University

     Tailandia

     
• Localización: Proyecciones: Journal of Mathematics, ISSN 0716-0917, ISSN-e 0717-6279, Vol. 41, Nº. 5, 2022, págs. 1153-1172
• Idioma: inglés
• Enlaces
  • Texto completo
• Resumen

  • 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.