A distance irregular k-labeling of a graph G is a function f : V (G) → ¶1, 2, . . . , k♢ such that the weights of all vertices are distinct. The weight of a vertex v, denoted by wt(v), is the sum of labels of all vertices ...

Let G be a simple graph. A distance irregular vertex k-labelling of a graph G is defined as a labelling λ:V(G)⟶{1,2,…,k} which is every two distinct vertices x,y∈V(G) have different weights, wt(x)≠wt(y). The weight of a ...

Additive Main Effect and Multiplicative Interaction (AMMI) model was commonly used to analyze Genotype Environment × Interaction with normal response variables, now it had been generalized for categorical or other ...

The labeling f is called super if the smallest possible labels appear on the vertices. A graph that admits (super) (a,d)-H-antimagic total labeling is called (super) (a,d)-H-antimagic.

For a simple graph G, an inclusive distance vertex irregular k-labeling of G is a mapping λ : V (G) → {1, 2, . . . , k} such that all the vertex-weights are pairwise distinct, where the weight of a vertex v, denoted by ...

Let G = (V, E) be a graph with a vertex set V and an edge set E. The graph G is said to be with a local irregular vertex coloring if there is a function f called a local irregularity vertex coloring with the properties: ...

We propose a new steganography method to hide an image into another image using matrix multiplication operations on max plus algebra. Tis is especially interesting because the matrix used in encoding or information disguises ...

This study is a natural extension of k -proper coloring of any simple and connected graph G. By a n rdynamic coloring of a graph G, we mean a proper k coloring of graph G such that the neighbors of any vert ...

Let G be a simple, connected and undirected graph. Given r; k as any natural numbers. By an r-dynamic k-coloring of graph G, we mean a proper k-coloring c(v) of G such that jc(N(v))j minfr; d(v)g for each vertex v in ...