International audienceThe total irregularity of a simple undirected graph G is denoted by irr t (G) and is defined as irr t (G) = 1 2 ∑ u,v∈V(G) �d(u) − d(v)�. In this paper, we introduce the notion of edge-transformation in relation to total irregularity of simple graphs with at least one cut edge as well as an edge-joint between two graphs. We also introduce the notion of total irregularity with respect to in-degree and out-degree in directed graphs. We also introduce the concept of total irregularity in respect of in-degree and out-degree in simple directed graphs. These invariants are called total in-irregularity and total out-irregularity, respectively. In this paper, we initiate a study on these parameters of given simple undirected g...
For a simple graph G with the vertex set V and the edge set E, a labeling\ud is called a vertex irre...
Abstract. Let graph G = (V,E) has V vertices and E edges. For every two different edges of graph G h...
Martin Bača et al. [2] introduced the problem of determining the total vertex irregularity strengths...
The total irregularity of a simple undirected graph G is denoted by $ irr_t(G) $ and is defined as $...
In this note a new measure of irregularity of a simple undirected graph G is in-troduced. It is name...
The irregularity of a simple undirected graph G was defined by Albertson [5] as irr(G) = ∑uv∈E(G) |d...
In this paper we determine the total edge irregularity strength of , that is a complete graph in whi...
AbstractA total edge irregular k-labelling ν of a graph G is a labelling of the vertices and edges o...
AbstractIt is an elementary exercise to show that any non-trivial simple graph has two vertices with...
The total edge irregularity strength of any graph G is the minimum integer number k such that G have...
We investigate the vertex total and edge total modication of the well-known irregularity strength of...
AbstractA totally irregular total k-labeling λ: V ∪ E → {1, 2, · · ·, k} of a graph G is a total lab...
AbstractThe imbalance of an edge uv in a graph G is defined as |d(u)-d(v)|, where d(u) denotes the d...
AbstractAs an edge variant of the well-known irregularity strength of a graph G=(V,E) we investigate...
AbstractTwo new graph characteristics, the total vertex irregularity strength and the total edge irr...
For a simple graph G with the vertex set V and the edge set E, a labeling\ud is called a vertex irre...
Abstract. Let graph G = (V,E) has V vertices and E edges. For every two different edges of graph G h...
Martin Bača et al. [2] introduced the problem of determining the total vertex irregularity strengths...
The total irregularity of a simple undirected graph G is denoted by $ irr_t(G) $ and is defined as $...
In this note a new measure of irregularity of a simple undirected graph G is in-troduced. It is name...
The irregularity of a simple undirected graph G was defined by Albertson [5] as irr(G) = ∑uv∈E(G) |d...
In this paper we determine the total edge irregularity strength of , that is a complete graph in whi...
AbstractA total edge irregular k-labelling ν of a graph G is a labelling of the vertices and edges o...
AbstractIt is an elementary exercise to show that any non-trivial simple graph has two vertices with...
The total edge irregularity strength of any graph G is the minimum integer number k such that G have...
We investigate the vertex total and edge total modication of the well-known irregularity strength of...
AbstractA totally irregular total k-labeling λ: V ∪ E → {1, 2, · · ·, k} of a graph G is a total lab...
AbstractThe imbalance of an edge uv in a graph G is defined as |d(u)-d(v)|, where d(u) denotes the d...
AbstractAs an edge variant of the well-known irregularity strength of a graph G=(V,E) we investigate...
AbstractTwo new graph characteristics, the total vertex irregularity strength and the total edge irr...
For a simple graph G with the vertex set V and the edge set E, a labeling\ud is called a vertex irre...
Abstract. Let graph G = (V,E) has V vertices and E edges. For every two different edges of graph G h...
Martin Bača et al. [2] introduced the problem of determining the total vertex irregularity strengths...