A new graph characteristic, even modular edge irregularity strength of graphs is introduced. Estimation on this parameter is obtained and the precise values of this parameter are obtained for some families of graphs.</div
Martin Bača et al. [2] introduced the problem of determining the total vertex irregularity strength...
Abstract. An assignment of positive integer weights to the edges of a simple graph G is called irreg...
AbstractIn this paper, we investigate the new graph characteristic, the edge irregularity strength, ...
We introduce a modular irregularity strength of graphs as modification of the well-known irregularit...
AbstractTwo new graph characteristics, the total vertex irregularity strength and the total edge irr...
A k-labeling from the vertex set of a simple graph G=(V,E) to a set of integers {1,2,…,k} is defined...
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...
An edge irregular total k-labeling f : V ∪ E → 1,2, ..., k of a graph G = (V,E) is a labeling of ver...
This paper deals with the modular irregularity strength of a graph of vertices, a new graph in...
International audienceThe irregularity strength of a graph G is the smallest possible value of k or ...
Given a graph G with weighting w: E(G) ~ Z+, the strength of G(w) is the maximum weight on any edge...
Abstract. A weighting of the edges of a graph is called irregular if the weighted degrees of the ver...
In this paper, we investigate the new graph characteristic, the edge irregularity strength, denoted ...
AbstractA total edge irregular k-labelling ν of a graph G is a labelling of the vertices and edges o...
Martin Bača et al. [2] introduced the problem of determining the total vertex irregularity strength...
Abstract. An assignment of positive integer weights to the edges of a simple graph G is called irreg...
AbstractIn this paper, we investigate the new graph characteristic, the edge irregularity strength, ...
We introduce a modular irregularity strength of graphs as modification of the well-known irregularit...
AbstractTwo new graph characteristics, the total vertex irregularity strength and the total edge irr...
A k-labeling from the vertex set of a simple graph G=(V,E) to a set of integers {1,2,…,k} is defined...
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...
An edge irregular total k-labeling f : V ∪ E → 1,2, ..., k of a graph G = (V,E) is a labeling of ver...
This paper deals with the modular irregularity strength of a graph of vertices, a new graph in...
International audienceThe irregularity strength of a graph G is the smallest possible value of k or ...
Given a graph G with weighting w: E(G) ~ Z+, the strength of G(w) is the maximum weight on any edge...
Abstract. A weighting of the edges of a graph is called irregular if the weighted degrees of the ver...
In this paper, we investigate the new graph characteristic, the edge irregularity strength, denoted ...
AbstractA total edge irregular k-labelling ν of a graph G is a labelling of the vertices and edges o...
Martin Bača et al. [2] introduced the problem of determining the total vertex irregularity strength...
Abstract. An assignment of positive integer weights to the edges of a simple graph G is called irreg...
AbstractIn this paper, we investigate the new graph characteristic, the edge irregularity strength, ...
DOI
Add to ORKG