AbstractG. Chartrand et al. showed in [1] that for odd m,m ⩾3, the edges of Km,m can be labeled with 1,2,3,4 in such a way that the (weighted) degrees of the vertices are all different. They conjectured that no such labeling exists with labels 1,2,3. In this note we prove this conjecture
The field of graph theory plays a vital role in various fields. One of the important areas in graph ...
AbstractIt is proved that if t is a fixed positive integer and n is sufficiently large, then each gr...
-Many networks have been found the total edge irregularity strength???s. In this paper, we found tha...
AbstractG. Chartrand et al. showed in [1] that for odd m,m ⩾3, the edges of Km,m can be labeled with...
It is easily observed that the vertices of a simple graph cannot have pairwise distinct degrees. Thi...
Abstract. A weighting of the edges of a graph is called irregular if the weighted degrees of the ver...
International audienceLet G be a graph, and l:E(G) → {1,...,k} be a k-labelling of G, i.e., an assig...
AbstractAssign positive integer weights to the edges of a simple graph G (with no isolated edges and...
A k-labeling from the vertex set of a simple graph G=(V,E) to a set of integers {1,2,…,k} is defined...
An edge irregular total k-labeling f : V ∪ E → 1,2, ..., k of a graph G = (V,E) is a labeling of ver...
An antimagic labeling of a graph G with m edges is a bijection from E(G) to {1, 2,...,m} such that f...
An assignment of positive integer weights to the edges of a simple graph G is called irregular if th...
AbstractAs an edge variant of the well-known irregularity strength of a graph G=(V,E) we investigate...
Consider a simple graph G with no isolated edges and at most one isolated vertex. A labeling w: E(G)...
AbstractA totally irregular total k-labeling λ: V ∪ E → {1, 2, · · ·, k} of a graph G is a total lab...
The field of graph theory plays a vital role in various fields. One of the important areas in graph ...
AbstractIt is proved that if t is a fixed positive integer and n is sufficiently large, then each gr...
-Many networks have been found the total edge irregularity strength???s. In this paper, we found tha...
AbstractG. Chartrand et al. showed in [1] that for odd m,m ⩾3, the edges of Km,m can be labeled with...
It is easily observed that the vertices of a simple graph cannot have pairwise distinct degrees. Thi...
Abstract. A weighting of the edges of a graph is called irregular if the weighted degrees of the ver...
International audienceLet G be a graph, and l:E(G) → {1,...,k} be a k-labelling of G, i.e., an assig...
AbstractAssign positive integer weights to the edges of a simple graph G (with no isolated edges and...
A k-labeling from the vertex set of a simple graph G=(V,E) to a set of integers {1,2,…,k} is defined...
An edge irregular total k-labeling f : V ∪ E → 1,2, ..., k of a graph G = (V,E) is a labeling of ver...
An antimagic labeling of a graph G with m edges is a bijection from E(G) to {1, 2,...,m} such that f...
An assignment of positive integer weights to the edges of a simple graph G is called irregular if th...
AbstractAs an edge variant of the well-known irregularity strength of a graph G=(V,E) we investigate...
Consider a simple graph G with no isolated edges and at most one isolated vertex. A labeling w: E(G)...
AbstractA totally irregular total k-labeling λ: V ∪ E → {1, 2, · · ·, k} of a graph G is a total lab...
The field of graph theory plays a vital role in various fields. One of the important areas in graph ...
AbstractIt is proved that if t is a fixed positive integer and n is sufficiently large, then each gr...
-Many networks have been found the total edge irregularity strength???s. In this paper, we found tha...
DOI
Add to ORKG