Add to ORKGIn this paper, we consider labelings of graphs in which the label on an edge is the absolute value of the difference of its vertex labels. Such a labeling using {0,1,2,..., 1}k − is called k-equitable if the number of vertices ( resp. edges) labeled i and the number of vertices (resp. edges) labeled j differ by at most one and is called k-balanced if the number of vertices labeled i and the number of edges labeled j differ by at most one. We determine which graphs in certain families are k-equitable or k-balanced and we give also some necessary conditions on these two labelings
A graph labeling is an assignment of integer label to the elements of graph in such a way that some ...
An equitable k-coloring of a graph G is a proper k-coloring of G such that the sizes of any two colo...
Let G = (V, E) be a graph with p vertices and q edges. Let f: V → {0, 1, 2, · · · , k} (1 ≤ k ≤ q...
AbstractA labeling of a graph is a function f from the vertex set to some subset of the natural numb...
International audienceIn this work, we consider equitable proper labellings of graphs, which were re...
In 1990 Cahit[4] proposed the idea of distributing the vertex and edge labels amongሼ0, 1, 2, ... , ...
The concept of vertex equitable labeling was introduced in [9]. A graph $G$ is said to be vertex eq...
When it comes to graphs, there have always been questions about different ways to label the vertices...
Cahit [4] proposed the concept of labeling the vertices and edges among the set of integers {0,1,2,…...
The Graceful Tree Conjecture in graph theory has been open for almost half a century. The conjecture...
AbstractLet G be a graph with vertex set V(G) and edge set E(G), and f be a 0−1 labeling of E(G) so ...
AbstractA group-labeled graph is a graph whose vertices and edges have been assigned labels from som...
A group-labeled graph is a graph whose vertices and edges have been assigned labels from some abelia...
AbstractA labelling of a simple graph G=(V,E) is an assignment f of integers to the vertices of G. U...
A labelling of a simple graph G = (V,E) is an assignment f of integers to the vertices of G. Under s...
A graph labeling is an assignment of integer label to the elements of graph in such a way that some ...
An equitable k-coloring of a graph G is a proper k-coloring of G such that the sizes of any two colo...
Let G = (V, E) be a graph with p vertices and q edges. Let f: V → {0, 1, 2, · · · , k} (1 ≤ k ≤ q...
AbstractA labeling of a graph is a function f from the vertex set to some subset of the natural numb...
International audienceIn this work, we consider equitable proper labellings of graphs, which were re...
In 1990 Cahit[4] proposed the idea of distributing the vertex and edge labels amongሼ0, 1, 2, ... , ...
The concept of vertex equitable labeling was introduced in [9]. A graph $G$ is said to be vertex eq...
When it comes to graphs, there have always been questions about different ways to label the vertices...
Cahit [4] proposed the concept of labeling the vertices and edges among the set of integers {0,1,2,…...
The Graceful Tree Conjecture in graph theory has been open for almost half a century. The conjecture...
AbstractLet G be a graph with vertex set V(G) and edge set E(G), and f be a 0−1 labeling of E(G) so ...
AbstractA group-labeled graph is a graph whose vertices and edges have been assigned labels from som...
A group-labeled graph is a graph whose vertices and edges have been assigned labels from some abelia...
AbstractA labelling of a simple graph G=(V,E) is an assignment f of integers to the vertices of G. U...
A labelling of a simple graph G = (V,E) is an assignment f of integers to the vertices of G. Under s...
A graph labeling is an assignment of integer label to the elements of graph in such a way that some ...
An equitable k-coloring of a graph G is a proper k-coloring of G such that the sizes of any two colo...
Let G = (V, E) be a graph with p vertices and q edges. Let f: V → {0, 1, 2, · · · , k} (1 ≤ k ≤ q...