Results 1 to 10 of about 848 (243)
Generating graceful unicyclic graphs from a given forest
AKCE International Journal of Graphs and Combinatorics, 2020 Acharya (1982) proved that every connected graph can be embedded in a graceful graph. The generalization of this result that, any set of graphs can be packed into a graceful graph was proved by Sethuraman and Elumalai (2005). Recently, Sethuraman et al. (
G. Sethuraman, V. Murugan
doaj +2 more sources
A structural approach to the graceful coloring of a subclass of trees [PDF]
Heliyon, 2023 Let M={1,2,..m} and G be a simple graph. A graceful m-coloring of G is a proper vertex coloring of G using the colors in M which leads to a proper edge coloring using M∖{m} colors such that the associated color of each edge is the absolute difference ...
Laavanya D, Devi Yamini S
doaj +2 more sources
A survey and a new class of graceful unicylic graphs
AKCE International Journal of Graphs and Combinatorics, 2020 A graph G admits a graceful labeling if there is a one-to-one map f from the set of vertices of G to such that when an edge xy is assigned the label the resulting set of edge labels is When such a labeling exists, G is called graceful. Rosa showed that a
Max Pambe Biatch’ +2 more
doaj +2 more sources
Edge odd graceful labeling of some path and cycle related graphs
AKCE International Journal of Graphs and Combinatorics, 2017 Solairaju and Chithra introduced a new type of labeling of a graph with vertices and edges called an edge odd graceful labeling if there is a bijection from the edges of the graph to the set such that, when each vertex is assigned the sum of all edges ...
S.N. Daoud
doaj +2 more sources
Graceful labeling on torch graph
Indonesian Journal of Combinatorics, 2018 Let G be a graph with vertex set V=V(G) and edge set E=E(G). An injective function f:V --> {0,1,2,...,|E|} is called graceful labeling if f induces a function f*(uv)=|f(u)-f(v)| which is a bijection from E(G) to the set {1,2,3,...,|E|}.
Jona Martinus Manulang, Kiki A. Sugeng
doaj +3 more sources
Edge even graceful labelling of new families of graphs
Journal of Taibah University for Science, 2019 Elsonbaty and Daoud introduced a new type of labelling of a graph G with p vertices and q edges called an edge even graceful labelling. A graph G is called edge even graceful if there is a bijection $f: E(G) \rightarrow \{2, 4,\ldots , 2q\} $ such that ...
S. N. Daoud, Ahmed N. Elsawy
doaj +2 more sources
Edge even graceful labelling of some book graphs
Journal of Taibah University for Science, 2018 Elsonbaty and Daoud introduced a new type of labelling of a graph G with p vertices and q edges called an edge even graceful labelling if there is a bijection f from the edges of the graph to the set $\{2, 4,\ldots , 2q\}$ such that, when each vertex is ...
S.N. Daoud, Ahmed N. Elsawy
doaj +2 more sources
Edge Odd Graceful Labeling in Some Wheel-Related Graphs
MathematicsA graph’s edge labeling involves the allocation of symbols (colors or numbers) to the edges of a graph governed by specific criteria. Such labeling of a graph G with order n and size m is named edge odd graceful if there is a bijective map φ from the set
Mohammed Aljohani, Salama Nagy Daoud
doaj +3 more sources
Gaussian Tribonacci R-Graceful Labeling of Some Tree Related Graphs
Ratio Mathematica, 2022 Let r be any natural number. An injective function , where is the Gaussian Tribonacci number in the Gaussian Tribonacci sequence is said to be Gaussian Tribonacci r-graceful labeling if the induced edge labeling such that is bijective.
K Sunitha, M Sheriba
doaj +1 more source
Jambura Journal of Mathematics, 2021 Graceful Labeling on graph G=(V, E) is an injective function f from the set of the vertex V(G) to the set of numbers {0,1,2,...,|E(G)|} which induces bijective function f from the set of edges E(G) to the set of numbers {1,2,...,|E(G)|} such that for ...
Meliana Pasaribu +2 more
doaj +1 more source