Edge irregular total labeling - Open Access .click

Results 31 to 40 of about 6,181 (108)

On H-irregularity strengths of G-amalgamation of graphs

Electronic Journal of Graph Theory and Applications, 2017
A simple graph G=(V(G),E(G)) admits an H-covering if every edge in E(G) belongs at least to one subgraph of G isomorphic to a given graph H. Then the graph G admitting H-covering admits an H-irregular total k-labeling f: V(G) U E(G) \to {1, 2, ..., k} if
Faraha Ashraf +3 more
doaj +1 more source

The Vertex And Edge Irregular Total Labeling Of An Amalgamation Of Two Isomorphic Cycles

, 2013
Suppose G(V,E) is a graph, a function f : V \cup E \to \{1, 2, 3, \cdots, k\} is called the total edge(vertex) irregular k-labelling for G such that for each two edges are different having distinct weights. The total edge(vertex) irregularity strength of G, denoted by tes(G)(tvs(G), is the smallest k positive integers such that G has a total edge ...
openaire +1 more source

On Total Vertex Irregularity Strength of Cocktail Party Graph

Jurnal Ilmu Dasar, 2011
A vertex irregular total k-labeling of a graph G is a function λ from both the vertex and the edge sets to {1,2,3,,k} such that for every pair of distinct vertices u and x, λ(u)+∑λ(uv)≠λ(x)+∑λ(xy). uv∈E xy∈E.
Kristiana Wijaya, S Slamin, Mirka Miller
doaj

Optimizing hybrid network topologies in communication networks through irregularity strength. [PDF]