Results 21 to 30 of about 1,000,377 (259)
Edge Odd Graceful Labeling in Some Wheel-Related Graphs
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
doaj +3 more sources
Gaussian Tribonacci R-Graceful Labeling of Some Tree Related Graphs
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
Graceful game on some graph classes
A graceful labeling of a graph $G$ with $m$ edges consists in labeling the vertices of $G$ with distinct integers from $0$ to $m$ such that each edge is uniquely identified by the absolute difference of the labels of its endpoints. In this work, we study
D. Oliveira +4 more
semanticscholar +1 more source
Graceful and felicitous labeling of Stem-Lotus graph
A graph obtained from a shell graph $C(2n+3, 2n)$ where $n \geq 1$ by adding a vertex in between each pair of adjacent vertices on the cycle, adding an edge in apex and two more chords is called a Stem-Lotus graph.
A. Elumalai
semanticscholar +1 more source
Graceful centers of graceful graphs and universal graceful graphs [PDF]
In this paper we define graceful center of a graceful graph. We proved any graph G which admits α-labeling has at least four graceful centers. We also defined a new strong concept of universal graceful graph. Some results on ring sum of two graphs for their graceful labeling are proved.
H. M. Makadia +2 more
openaire +3 more sources
Graceful Labeling of Prime Index Graph of Group Zp × Zpn
The prime index graph π(G) of a finite group G is a special type of undirected simple graph whose vertex set is set of subgroups of G, in which two distinct vertices are adjacent if one has prime index in the other. Let p and q be distinct primes.
Renu, Sarita, Amit Sehgal, Archana Malik
semanticscholar +1 more source
Polygonal Graceful Labeling of Some Simple Graphs
Let be a graph with vertices and edges. Let andbe the vertex set and edge set of respectively. A polygonal graceful labeling of a graph is an injective function , where is a set of all non-negative integers that induces a bijection , where is the ...
A Rama Lakshmi, M P Syed Ali Nisaya
doaj +1 more source
Extending of Edge Even Graceful Labeling of Graphs to Strong r-Edge Even Graceful Labeling
Edge even graceful labeling of a graph G with p vertices and q edges is a bijective f from the set of edge EG to the set of positive integers 2,4,…,2q such that all the vertex labels f∗VG, given by f∗u=∑uv∈EGfuvmod2k, where k=maxp,q, are pairwise ...
Mohamed R. Zeen El Deen, Nora A. Omar
doaj +1 more source
PELABELAN ODD-GRACEFUL PADA GRAF PRODUK SISIR
Gnanajothi defined a graph with edges to be odd-graceful if there is an injective function such that if every edge is labelled with the resulting edge labels are . She proved that the graph obtained by joining one pendant to every vertex in is odd-
Juan Daniel +3 more
doaj +1 more source

