ARTICLE
TITLE

On reflexive edge strength of generalized prism graphs

SUMMARY

Let G be a connected, simple and undirected graph. The assignments {0, 2, …, 2kv} to the vertices and {1, 2, …, ke} to the edges of graph G are called total k-labelings, where k = max{ke, 2kv}. The total k-labeling is called an reflexive edge irregular k-labeling of the graph G, if for every two different edges xy and x'y' of G, one haswt(xy)=fv(x)+fe(xy)+fv(y)?wt(x'y') = fv(x') + fe(x'y') + fv(y').The minimum k for which the graph G has an reflexive edge irregular k-labeling is called the reflexive edge strength of G. In this paper we investigate the exact value of reflexive edge strength for generalized prism graphs.

PAGES
pp. 415 - 424

 Articles related

Rikio Ichishima,Francesc A Muntaner-Batle,Akito Oshima    

A bipartite graph G with partite sets X and Y is called consecutively super edge-magic if there exists a bijective function f : V(G) ? E(G) ? {1,2,...,|V(G)| + |E(G)|} with the property that f(X) = {1,2,...,|X|}, f(Y) = {|X|+1, |X|+2,...,|V(G)|} and f(u)... see more


Anak Agung Gede Ngurah,Rinovia Simanjuntak    

A graph G of order |V(G)| = p and size |E(G)| = q is called super edge-magic if there exists a bijection f : V(G) ? E(G) ? {1, 2, 3, ?, p + q} such that f(x) + f(xy) + f(y) is a constant for every edge xy ? E(G) and f(V(G)) = {1, 2, 3, ?, p}. Furthermore... see more


Ali Ahmad,Ashok Gupta,Rinovia Simanjuntak    

In computer science, graphs are used in variety of applications directly or indirectly. Especially quantitative labeled graphs have played a vital role in computational linguistics, decision making software tools, coding theory and path determination in ... see more


Hassan Hadi Saleh    

The security of data storage in “cloud” is big challenge because the data keep within resources that may be accessed by particular machines. The managing of these data and services may not be high reliable. Therefore, the security of data is highly chall... see more


Hilda Assiyatun,Maya Nabila,Edy Tri Baskoro    

Let F, G and H be any simple graphs. The notation F ? (G, H) means for any red-blue coloring on the edges of graph F, there exists either a red copy of G or a blue copy of H. If F ? (G, H), then grap... see more