Scribd Logo
Upload

Welcome to Scribd!

  • 42 views

    Relaxed Skolem Mean Labeling of Four Star Graphs

    Uploaded by

    Vino
    The document defines and provides notation for relaxed Skolem mean graphs and labeling. It then proves that a four star graph G consisting of four components K1,λ1, K1,λ2, K1,λ3, K1,λ, where the λ values are in ascending order, is a relaxed Skolem mean graph if λ = λ1 + λ2 + λ3. It does this by defining a relaxed vertex labeling function f that maps the vertices to distinct integer labels, and showing that this induces distinct integer edge labels between each pair of vertices, satisfying the definition of a relaxed Skolem mean graph.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Relaxed Skolem Mean Labeling of Four Star Graphs

    Uploaded by

    Vino
    42 views5 pages
    The document defines and provides notation for relaxed Skolem mean graphs and labeling. It then proves that a four star graph G consisting of four components K1,λ1, K1,λ2, K1,λ3, K1,λ, where the λ values are in ascending order, is a relaxed Skolem mean graph if λ = λ1 + λ2 + λ3. It does this by defining a relaxed vertex labeling function f that maps the vertices to distinct integer labels, and showing that this induces distinct integer edge labels between each pair of vertices, satisfying the definition of a relaxed Skolem mean graph.

    Original Description:

    Gra0h theory paper

    Original Title

    RELAXED SKOLEM MEAN LABELING OF FOUR STAR GRAPHS

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document defines and provides notation for relaxed Skolem mean graphs and labeling. It then proves that a four star graph G consisting of four components K1,λ1, K1,λ2, K1,λ3, K1,λ, where the λ values are in ascending order, is a relaxed Skolem mean graph if λ = λ1 + λ2 + λ3. It does this by defining a relaxed vertex labeling function f that maps the vertices to distinct integer labels, and showing that this induces distinct integer edge labels between each pair of vertices, satisfying the definition of a relaxed Skolem mean graph.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    42 views5 pages

    Relaxed Skolem Mean Labeling of Four Star Graphs

    Uploaded by

    Vino
    The document defines and provides notation for relaxed Skolem mean graphs and labeling. It then proves that a four star graph G consisting of four components K1,λ1, K1,λ2, K1,λ3, K1,λ, where the λ values are in ascending order, is a relaxed Skolem mean graph if λ = λ1 + λ2 + λ3. It does this by defining a relaxed vertex labeling function f that maps the vertices to distinct integer labels, and showing that this induces distinct integer edge labels between each pair of vertices, satisfying the definition of a relaxed Skolem mean graph.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 5

    RELAXED SKOLEM MEAN LABELING OF FOUR STAR

    GRAPHS G  K1,1  K1, 2  K1, 3  K1, WHERE 1 ,  2 ,  3 ARE IN

    ASCENDING ORDER WITH   1   2   3

    Notation: If x is a real number, the integral part of x is denoted by

     x  is the largest integer less than or equal to x.


    Example: 3.4  3 and 5  5 .

    Definition: A graph G  V , E  with p vertices and q edges is said to

    be a relaxed skolem mean graph if there exists a function

    f :V  1,2,3,..., p 1  V  1 called relaxed skolem vertex function

    (or briefly rsv function) such that the resultant edge map

    f * : E  2,3,..., p  V  1 (we call it relaxed skolem edge function

     f (u) f (v) 1 
    (or briefly rse function) given by f *(e  uv)   
     2 

    then, the distinct edge labels are from the set 2,3,...,p 1  V  1

    Note: There are p vertices and available vertex labels are p + 1 and

    hence one number from the set 1,2,3,...,p+1= V +1 is not used as a

    label of a vertex and we call that number as the relaxed label. When
    the relaxed label is p + 1, the relaxed mean labeling becomes a skolem

    mean labeling.

    Result 1: In a skolem mean graph, p  q + 1 and in the relaxed

    skolem mean labeling p  q.

    Result 2: The three star graph K1,   K1,  K1,  is a relaxed skolem

    mean graph if      .

    Theorem: The four star graph G  K1,1  K1, 2  K1, 3  K1, where

    1 ,  2 ,  3 are in ascending order is a relaxed skolem mean graph if

      1   2   3

    k
    Proof: Let L k    j; 1  k  3 . Hence we have, L1  1; L2  1   2
    j1

    and L3  1   2   3 .

    Consider the four star graph G  K1,1  K1, 2  K1, 3  K1, .

    The condition     j  4    L3  4    L3  1 and   L3  1 .


    j1

    We have here two cases and in both the cases we prove the result. Let

    V  V1  V2  V3  V4 be the vertex set of G where


     
    Vk  v k,i : 0  i   k  ; for 1  k  3 and V4  v 4,i : 0  i   . Let

    3
    E  {vk,0 vk,i :1  i   k } {v4,0v4,i :1  i  } be the edge set of G.
    k 1

    Let   L3

    The number of vertices in G = L3    4  2L3  4 vertices and L3    2L3

    edges.

    The rsv function f is defined

    f : V  {1,2,...,p 1  L3    4  1  2L3  5} as follows:

    f (v1,0 )  1; f (v2,0 )  2; f (v3,0 )  3;

    f(v4,0 )  L3    5  2L3  5

    f (v1,k )  2k  3 1  k  1

    f (v 2,k )  2L1  2k  3 1 k  2

    f (v3,k )  2L 2  2k  3 1  k   3

    f (v4,k )  2k  2 1  k    L3

    Here 2L3  4 is the relaxed label.

    We get the induced edge labels as follows:

    The edge labels of v1,0 v1,k is 2  k for 1  k  1 (edge labels are

    3,4,..., 1  2  L1  2 ), v 2,0 v 2,j is L1  3  k for 1  k   2 (edge labels are

    L1  4,L1  5,...,L1   2  3  L2  3 ), v3,0 v3,k is L 2  3  k for 1  k   3 (edge


    labels are L2  4,L2  5,...,L2   3  3  L3  3 ), v4,0 v4,k is L3  4  k for

    1  k    L3 (edge labels are

    L3  5, L3  6,..., L3    5  L3   L3   4  2L3  4).

    The edge labels of the graph are therefore 3,4,...,L1  2,

    L1  4,L1  5,...,L2  3, L2  4,L2  5,...,L3  3, L3  5, L3  6,...,2L3  4.

    Hence we have got that the induced edge labels of the graph G are

    therefore distinct. Therefore G is a relaxed skolem mean graph.

    Example:

    You might also like