Abstract A graceful labelling of a graph with n edges is a vertex labelling where the induced set of edge weights is {1, . . . , n}. A near graceful labelling is almost the same, the difference being that the edge weights are {1, 2, . . . , n − 1, n + 1}. In both cases, the weight of an edge is the absolute difference between its two vertex labels. Ros
Graph labeling is an assignment of integers to the vertices and/or edges of a graph, subject to cert...
A graph of size n is said to be graceful when is possible to assign distinct integers from {0, 1,......
Graph labeling is one of the most popular research areas in graph theory. There is a vast amount of ...
A graceful labelling of an undirected graph G with n edges is a one-to-one function from the set of ...
A graceful labeling of a graph G with m edges consists in labeling the vertices of G with distinct i...
A graceful labeling of a graph G of size n is an injective assignment of labels from {0,1,... n} to ...
The Graceful Tree Conjecture is a problem in graph theory that dates back to 1967. It suggests that...
A graph labeling is an assignment of integer label to the elements of graph in such a way that some ...
A graph with m edges is defined to be graceful if its vertices can be labeled using the integers 0,1...
The graceful labeling problem is a famous open problem in mathematics and computer science, first de...
Elsonbaty and Daoud introduced a new type of labelling of a graph G with p vertices and q edges call...
A labelling or numbering of a graph G with q edges is an assignment of labels to the vertices of G t...
A graceful labeling of a graph G with m edges is a function f: V (G) ! f0; : : : ; mg such that dist...
Given a graph G consisting of vertices and edges, a vertex labeling of G is an assignment f of label...
A graceful labeling of a graph G with n edges is an injective function from the set of vertices of G...
Graph labeling is an assignment of integers to the vertices and/or edges of a graph, subject to cert...
A graph of size n is said to be graceful when is possible to assign distinct integers from {0, 1,......
Graph labeling is one of the most popular research areas in graph theory. There is a vast amount of ...
A graceful labelling of an undirected graph G with n edges is a one-to-one function from the set of ...
A graceful labeling of a graph G with m edges consists in labeling the vertices of G with distinct i...
A graceful labeling of a graph G of size n is an injective assignment of labels from {0,1,... n} to ...
The Graceful Tree Conjecture is a problem in graph theory that dates back to 1967. It suggests that...
A graph labeling is an assignment of integer label to the elements of graph in such a way that some ...
A graph with m edges is defined to be graceful if its vertices can be labeled using the integers 0,1...
The graceful labeling problem is a famous open problem in mathematics and computer science, first de...
Elsonbaty and Daoud introduced a new type of labelling of a graph G with p vertices and q edges call...
A labelling or numbering of a graph G with q edges is an assignment of labels to the vertices of G t...
A graceful labeling of a graph G with m edges is a function f: V (G) ! f0; : : : ; mg such that dist...
Given a graph G consisting of vertices and edges, a vertex labeling of G is an assignment f of label...
A graceful labeling of a graph G with n edges is an injective function from the set of vertices of G...
Graph labeling is an assignment of integers to the vertices and/or edges of a graph, subject to cert...
A graph of size n is said to be graceful when is possible to assign distinct integers from {0, 1,......
Graph labeling is one of the most popular research areas in graph theory. There is a vast amount of ...
Add to ORKG