We introduce a modular irregularity strength of graphs as modification of the well-known irregularity strength. We obtain some estimation on modular irregularity strength and determine the exact values of this parameter for five families of graphs.</p
Abstract. A weighting of the edges of a graph is called irregular if the weighted degrees of the ver...
AbstractTwo new graph characteristics, the total vertex irregularity strength and the total edge irr...
The field of graph theory plays a vital role in various fields. One of the important areas in graph ...
A new graph characteristic, even modular edge irregularity strength of graphs is introduced. Estimat...
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...
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...
An assignment of positive integer weights to the edges of a simple graph G is called irregular if th...
It is easily observed that the vertices of a simple graph cannot have pairwise distinct degrees. Thi...
AbstractWe investigate the following modification of the well-known irregularity strength of graphs....
Abstract. An assignment of positive integer weights to the edges of a simple graph G is called irreg...
Clustering algorithms for large networks typically use modularity values to test which partitions of...
AbstractAn assignment of positive integer weights to the edges of a simple graph G is called irregul...
Abstract. A weighting of the edges of a graph is called irregular if the weighted degrees of the ver...
AbstractTwo new graph characteristics, the total vertex irregularity strength and the total edge irr...
The field of graph theory plays a vital role in various fields. One of the important areas in graph ...
A new graph characteristic, even modular edge irregularity strength of graphs is introduced. Estimat...
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...
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...
An assignment of positive integer weights to the edges of a simple graph G is called irregular if th...
It is easily observed that the vertices of a simple graph cannot have pairwise distinct degrees. Thi...
AbstractWe investigate the following modification of the well-known irregularity strength of graphs....
Abstract. An assignment of positive integer weights to the edges of a simple graph G is called irreg...
Clustering algorithms for large networks typically use modularity values to test which partitions of...
AbstractAn assignment of positive integer weights to the edges of a simple graph G is called irregul...
Abstract. A weighting of the edges of a graph is called irregular if the weighted degrees of the ver...
AbstractTwo new graph characteristics, the total vertex irregularity strength and the total edge irr...
The field of graph theory plays a vital role in various fields. One of the important areas in graph ...