Results 1 to 10 of about 6,640 (179)

m-Bonacci graceful labeling [PDF]

AKCE International Journal of Graphs and Combinatorics, 2021
We introduce new labeling called m-bonacci graceful labeling. A graph G on n edges is m-bonacci graceful if the vertices can be labeled with distinct integers from the set such that the derived edge labels are the first n m-bonacci numbers.
Kalpana Mahalingam, Helda Princy Rajendran   +1 more
doaj   +2 more sources

Graceful labeling of digraphs—a survey [PDF]

AKCE International Journal of Graphs and Combinatorics, 2021
A digraph D with p vertices and q arcs is labeled by assigning a distinct integer value g(v) from to each vertex v. The vertex values, in turn, induce a value g(u, v) on each arc (u, v) where g(u, v) = (g(v) − g(u)) (mod q + 1) If the arc values are all ...
Shivarajkumar, M. A. Sriraj, S. M. Hegde
doaj   +2 more sources

Radio Graceful Labelling of Graphs

Theory and Applications of Graphs, 2020
Radio labelling problem of graphs have their roots in communication problem known as \emph{Channel Assignment Problem}. For a simple connected graph $G=(V(G), E(G))$, a radio labeling is a mapping $f \colon V(G)\rightarrow \{0,1,2,\ldots\}$ such that $|f(
Laxman Saha, Alamgir Basunia
doaj   +5 more sources

On d-graceful labelings

Ars Comb., 2012
In this paper we introduce a generalization of the well known concept of a graceful labeling. Given a graph G with e=dm edges, we call d-graceful labeling of G an injective function from V(G) to the set {0,1,2,..., d(m+1)-1} such that {|f(x)-f(y)| | [x,y]
Pasotti, A.
core   +3 more sources

Further results on super graceful labeling of graphs

AKCE International Journal of Graphs and Combinatorics, 2016
Let G=(V(G),E(G)) be a simple, finite and undirected graph of order p and size q. A bijection f:V(G)∪E(G)→{k,k+1,k+2,…,k+p+q−1} such that f(uv)=|f(u)−f(v)| for every edge uv∈E(G) is said to be a k-super graceful labeling of G.
Gee-Choon Lau, Wai Chee Shiu
exaly   +3 more sources

Lucas Graceful Labeling for Some Graphs [PDF]

, 2011
By a graph, we mean a finite undirected graph without loops or multiple ...
Nagarajan, A., Perumal, M.A., S.Navaneethakrishnan   +2 more
core   +4 more sources

Computer search for graceful labeling: a survey

Electronic Journal of Graph Theory and Applications, 2022
This paper surveys the main computer search results for finding graceful labeling of trees. The paper is devoted to the memory of Mirka Miller, who made an outstanding contribution to the area of graph labeling.
Ljiljana Brankovic, Michael J. Reynolds
doaj   +2 more sources

Edge Odd Graceful Labeling in Some Wheel-Related Graphs

Mathematics
A 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
exaly   +3 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
exaly   +2 more sources

The Edge Odd Graceful Labeling of Water Wheel Graphs

Axioms
A graph, G=(V,E), is edge odd graceful if it possesses edge odd graceful labeling. This labeling is defined as a bijection g:E(G)→{1,3,…,2m−1}, from which an injective transformation is derived, g*:V(G)→{1,2,3,…,2m−1}, from the rule that the image of u∈V(
S N Daoud
exaly   +3 more sources