On irregular total labellings - ScienceDirect Skip to main contentSkip to article Elsevier logo
Journals & Books Help Search My account Sign in View PDF Download full issue Search …

The generalized prism P nm can be defined as the Cartesian product C n□ P m of a cycle
on n vertices with a path on m vertices. An edge irregular total k-labeling of a graph G is …

Consider a graph G=(V,E) of minimum degree δ and order n. Its irregularity strength is the
smallest integer k for which one can find a weighting w:E→{1,2,...,k\} such that …

An edge irregular total k-labeling φ: V (G)∪ E (G)→{1, 2,…, k} of a graph G=(V, E) is a
labeling of vertices and edges of G in such a way that for any different edges xy and x′ y …

An edge irregular total k-labeling of a graph G=(V, E) is a labeling φ: V∪ E→{1, 2,..., k} such
that the total edge-weights wt (xy)= φ (x)+ φ (xy)+ φ (y) are different for all pairs of distinct …

Let G be a simple graph of order n with no isolated vertices and no isolated edges. For a
positive integer w, an assignment f on G is a function f: E (G)→{1, 2,…, w}. For a vertex v, f (v) …

An edge irregular total k-labeling of a graph G is a labeling of the vertices and edges with
labels 1, 2,..., k such that the weights of any two different edges are distinct, where the weight …

In this paper, we study the total edge irregularity strength of some well known graphs. An
edge irregular total k-labeling ϕ: V∪ E→{1, 2,..., k} of a graph G=(V, E) is a labeling of …

The irregularity strength of a simple graph, denoted is a certain measure of the level of
irregularity of a graph. It indicates how hard it is to make an irregular multigraph of G via …

Total vertex irregularity strength of wheel related graphs Page 1 AUSTRALASIAN JOURNAL OF
COMBINATORICS Volume 51 (2011), Pages 147–156 Total vertex irregularity strength of wheel …