DSpace Repository

Browsing by Author "Saduakdee S."

Browsing by Author "Saduakdee S."

Sort by: Order: Results:

  • Saduakdee S.; Khemmani V. (American Institute of Mathematical Sciences, 2023)
    Let G be a graph of order n and size m. A vertex magic total labeling of G is a one-to-one function f: V(G)∪E(G) → {1, 2, · · ·, n+m} with the property that for each vertex u of G, the sum of the label of u and the labels ...
  • Saduakdee S.; Khemmani V. (2018)
    Let G be a graph of order n and size m. A γ-labeling of G is a one-to-one function f: V (G) → {0, 1, 2, …, m} that induces an edge-labeling f′: E(G) → {1, 2, …, m} on G defined by f′ (e) = |f(u) − f(v)|, for each edge e = ...
  • Khemmani V.; Saduakdee S. (2015)
    Let G be a graph of order n and size m. A γ-labeling of G is a one-to-one function f : V (G) → {0, 1, 2, . . . ,m} that induces an edge-labeling f' : E(G) → {1, 2, . . . ,m} on G defined by f'(e) = |f(u) - f(v)| for each ...
  • Saduakdee S.; Khemmani V. (2016)
    Let G be a graph of order n and size m. A γ-labeling of G is a one-to-one function f: V (G) → {0, 1, 2, …, m} that induces an edge-labeling f':E(G) → {1,2,…,M on G defined by(Formula presented) In this paper, we determine ...
  • Saduakdee S.; Khemmani V. (2018)
    Let G be a graph of order n and size m. A γ-labeling of G is a one-To-one function / : V(G) → { 0 , 1 , 2 , . . . , m} that induces an edge-labeling f : E(G)→ {1,2,..., m} on G defined by f ( e ) = |f/(ii) - f(i>)|, for ...