Results 31 to 40 of about 1,379,256 (326)
An Effective Method of Graceful Labeling for Pendant Graphs
International Journal of Integrative SciencesThis study focuses on the significant branch of graph theory known as graceful labeling, which involves assigning integers to the vertices and edges of graphs.
Dinushi Dhananjalee Samarakoon Bathwadana Ralalage +1 more
openalex +3 more sources
, 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
Lucas Graceful Labeling for Some Graphs [PDF]
viXra, 2011 By a graph, we mean a finite undirected graph without loops or multiple ...
Nagarajan, A. +2 more
core +4 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, Ho-Kuen Ng
doaj +3 more sources
Arithmetic Sequential Graceful Labeling on Star Related Graphs [PDF]
Indian Journal of Science and Technology, 2022 P Sumathi, G Geetha Ramani
openalex +2 more sources
Further results on edge even graceful labeling of the join of two graphs
Journal of the Egyptian Mathematical Society, 2020 In this paper, we investigated the edge even graceful labeling property of the join of two graphs. A function f is called an edge even graceful labeling of a graph G=(V(G),E(G)) with p=|V(G)| vertices and q=|E(G)| edges if f:E(G)→{2,4,...,2q} is ...
Mohamed R. Zeen El Deen, Nora A. Omar
doaj +2 more sources
A Graceful Labeling of Square of Path Graph with Quadratic Complexity Algorithm
WSEAS Transactions on Mathematics, 2021 A method for relaxed graceful labeling of P2n graphs is presented together with an algorithm designed for labeling these graphs. Graceful labeling is achieved by relaxing the range to 2m and perform the labeling using an algorithm with quadratic ...
Faris M. Taweel +2 more
openalex +2 more sources
Edge δ− Graceful Labeling for Some Cyclic-Related Graphs
Advances in Mathematical Physics, 2020 In this paper, we introduce a new type of labeling of a graph G with p vertices and q edges called edge δ− graceful labeling, for any positive integer δ, as a bijective mapping f of the edge set EG into the set δ,2δ,3δ,⋯,qδ such that the induced mapping ...
Mohamed R. Zeen El Deen
doaj +2 more sources
Discrete Mathematics, 2007 AbstractIt is easily shown that every path has a graceful labelling, however, in this paper we show that given almost any path P with n vertices then for every vertex v∈V(P) and for every integer i∈{0,…,n-1} there is a graceful labelling of P such that v has label i. We show precisely when these labellings can also be α-labellings.
Rohan Cattell
openalex +3 more sources
Even vertex $ζ$-graceful labeling on Rough Graph
Mathematics and Statistics, 2022 R. Nithya, K. Anitha
openalex +3 more sources