SciELO - Scientific Electronic Library Online

 
vol.37 issue1The fixed point and the common fixed point properties in finite pseudo-ordered setsA variant of the quadratic functional equation on semigroups author indexsubject indexarticles search
Home Pagealphabetic serial listing  

Services on Demand

Journal

Article

Indicators

Related links

  • On index processCited by Google
  • Have no similar articlesSimilars in SciELO
  • On index processSimilars in Google

Share


Proyecciones (Antofagasta)

Print version ISSN 0716-0917

Abstract

SANTHAKUMARAN, A. P.  and  BALAGANESAN, P.. Vertex graceful labeling of some classes of graphs. Proyecciones (Antofagasta) [online]. 2018, vol.37, n.1, pp.19-43. ISSN 0716-0917.  http://dx.doi.org/10.4067/S0716-09172018000100019.

A connected graph G = (V,E) of order atleast two, with order p and size q is called vertex-graceful if there exists a bijection ʄ : V → { 1, 2, 3, ··· p } such that the induced function ʄ*: E → { 0, 1, 2, ··· q-1} defined by ʄ*(uv) = (ʄ(u)+ ʄ(v)) (mod q) is a bijection. The bijection ʄ is called a vertex-graceful labeling of G. A subset S of the set of natural numbers N is called consecutive if S consists of consecutive integers. For any set X, a mapping ʄ : X → N $ is said to be consecutive if ʄ(X) is consecutive. A vertex-graceful labeling ʄ is said to be strong if the function ʄ1: E → N defined by ʄ1(e)= ʄ(u) + ʄ(v) for all edges e = uv in E forms a consecutive set. It is proved that one vertex union of odd number of copies of isomorphic caterpillars is vertex-graceful and any caterpillar is strong vertex-graceful. It is proved that a spider with even number of legs (paths) of equal length appended to each vertex of an odd cycle is vertex-graceful. It is also proved that the graph lA(mj,n) is vertex-graceful for both n and l odd, 0 ≤ i ≤ n-1, 1 ≤ j ≤ mi. Further, it is proved that the graph A(mj, n) is strong vertex-graceful for n odd, 0 ≤ i ≤ n-1, 1 ≤ j ≤ mi.

Keywords : Caterpillar; one vertex union graphs; regular spider; actinia graph; vertex-graceful labeling; strong vertex-graceful labeling.

        · text in English     · English ( pdf )