The concept of fuzzy graceful labelling is introduced. A graph which admits a fuzzy graceful labelling is called a fuzzy graceful graph. Fuzzy graceful labelled graphs are becoming an increasingly useful family of mathematical models for a broad range of applications. In this paper the concept of fuzzy graceful labelling is applied to complete bipartite graphs. Also we discussed the edge and vertex gracefulness of some complete bipartite graphs
Elsonbaty and Daoud introduced a new type of labelling of a graph G with p vertices and q edges call...
A graceful labeling of a graph G of size n is an injective assignment of labels from {0,1,... n} to ...
For positive integers m, n, K m,n represents the complete bipartite graph. We name the graph G = K m...
This paper presents a pattern of labeling for some special graceful graphs like paths, cycles, compl...
Graph labeling is an assignment of integers to the vertices and/or edges of a graph, subject to cert...
Graph labeling is an assignment of integers to the vertices and/or edges of a graph, subject to cert...
In this paper a brief discussion is made on the super vertex graceful graphs. In particular the orde...
A graph with m edges is defined to be graceful if its vertices can be labeled using the integers 0,1...
A graph with m edges is defined to be graceful if its vertices can be labeled using the integers 0,1...
In this paper we have shown that the the splitting graph of the complete bi-partite graph Km, n is g...
Abstract. A labeled graph G which can be gracefully numbered is said to be graceful. Labeling the no...
For positive integers m, n, Km, n represents the complete bipartite graph. We name the graph G = Km,...
Labelling problems are very useful in modelling, solving problems in other areas and enhance the stu...
We introduce new labeling called m-bonacci graceful labeling. A graph G on n edges is m-bonacci grac...
A simple graph is said to be a vertex -graceful if there exists a vertex graceful labeling on the ...
Elsonbaty and Daoud introduced a new type of labelling of a graph G with p vertices and q edges call...
A graceful labeling of a graph G of size n is an injective assignment of labels from {0,1,... n} to ...
For positive integers m, n, K m,n represents the complete bipartite graph. We name the graph G = K m...
This paper presents a pattern of labeling for some special graceful graphs like paths, cycles, compl...
Graph labeling is an assignment of integers to the vertices and/or edges of a graph, subject to cert...
Graph labeling is an assignment of integers to the vertices and/or edges of a graph, subject to cert...
In this paper a brief discussion is made on the super vertex graceful graphs. In particular the orde...
A graph with m edges is defined to be graceful if its vertices can be labeled using the integers 0,1...
A graph with m edges is defined to be graceful if its vertices can be labeled using the integers 0,1...
In this paper we have shown that the the splitting graph of the complete bi-partite graph Km, n is g...
Abstract. A labeled graph G which can be gracefully numbered is said to be graceful. Labeling the no...
For positive integers m, n, Km, n represents the complete bipartite graph. We name the graph G = Km,...
Labelling problems are very useful in modelling, solving problems in other areas and enhance the stu...
We introduce new labeling called m-bonacci graceful labeling. A graph G on n edges is m-bonacci grac...
A simple graph is said to be a vertex -graceful if there exists a vertex graceful labeling on the ...
Elsonbaty and Daoud introduced a new type of labelling of a graph G with p vertices and q edges call...
A graceful labeling of a graph G of size n is an injective assignment of labels from {0,1,... n} to ...
For positive integers m, n, K m,n represents the complete bipartite graph. We name the graph G = K m...
DOI
Add to ORKG