Add to ORKGMartin Bača et al. [2] introduced the problem of determining the total vertex irregularity strengths of graphs. In this paper we discuss how the addition of new edge affect the total vertex irregularity strength
AbstractA total edge irregular k-labelling ν of a graph G is a labelling of the vertices and edges o...
AbstractA total vertex irregularity strength of a graph G, tvs(G), is the minimum positive integer k...
Abstract. An assignment of positive integer weights to the edges of a simple graph G is called irreg...
Martin Bača et al. [2] introduced the problem of determining the total vertex irregularity strengths...
In this paper we determine the total edge irregularity strength of , that is a complete graph in whi...
AbstractWe investigate the following modification of the well-known irregularity strength of graphs....
An edge irregular total k-labeling f : V ∪ E → 1,2, ..., k of a graph G = (V,E) is a labeling of ver...
Abstract. A weighting of the edges of a graph is called irregular if the weighted degrees of the ver...
For a simple graph G with the vertex set V and the edge set E, a labeling\ud is called a vertex irre...
Let $G=(V(G),E(G))$ be a graph and $k$ be a positive integer. A total $k$-labeling of $G$ is a map $...
A new graph characteristic, even modular edge irregularity strength of graphs is introduced. Estimat...
<p>In computer science, graphs are used in variety of applications directly or indirectly. Especiall...
AbstractA vertex irregular total k-labelling λ:V(G)∪E(G)⟶{1,2,…,k} of a graph G is a labelling of ve...
We investigate two modifications of the well-known irregularity strength of graphs, namely the total...
Given a graph G with weighting w: E(G) ~ Z+, the strength of G(w) is the maximum weight on any edge...
AbstractA total edge irregular k-labelling ν of a graph G is a labelling of the vertices and edges o...
AbstractA total vertex irregularity strength of a graph G, tvs(G), is the minimum positive integer k...
Abstract. An assignment of positive integer weights to the edges of a simple graph G is called irreg...
Martin Bača et al. [2] introduced the problem of determining the total vertex irregularity strengths...
In this paper we determine the total edge irregularity strength of , that is a complete graph in whi...
AbstractWe investigate the following modification of the well-known irregularity strength of graphs....
An edge irregular total k-labeling f : V ∪ E → 1,2, ..., k of a graph G = (V,E) is a labeling of ver...
Abstract. A weighting of the edges of a graph is called irregular if the weighted degrees of the ver...
For a simple graph G with the vertex set V and the edge set E, a labeling\ud is called a vertex irre...
Let $G=(V(G),E(G))$ be a graph and $k$ be a positive integer. A total $k$-labeling of $G$ is a map $...
A new graph characteristic, even modular edge irregularity strength of graphs is introduced. Estimat...
<p>In computer science, graphs are used in variety of applications directly or indirectly. Especiall...
AbstractA vertex irregular total k-labelling λ:V(G)∪E(G)⟶{1,2,…,k} of a graph G is a labelling of ve...
We investigate two modifications of the well-known irregularity strength of graphs, namely the total...
Given a graph G with weighting w: E(G) ~ Z+, the strength of G(w) is the maximum weight on any edge...
AbstractA total edge irregular k-labelling ν of a graph G is a labelling of the vertices and edges o...
AbstractA total vertex irregularity strength of a graph G, tvs(G), is the minimum positive integer k...
Abstract. An assignment of positive integer weights to the edges of a simple graph G is called irreg...