Results 41 to 50 of about 1,379,256 (326)
Hilbert Graceful Labeling on Complete Multipartite Graph
Asian Research Journal of Mathematics.
J. Suresh Kumar
openalex +2 more sources
Graceful Labeling of Some Spider Graphs
European Journal of Pure and Applied MathematicsA graceful labeling of a tree $T$ with $n$ edges is a bijection $f : V(T) \longrightarrow \{0,1,2, \ldots n\}$ such that $\{|f(u)-f(v)| : uv \in E(T)\}$ equal to $\{1,2,3,\ldots,n\}$.
K. Saengsura, T. Poomsa-ard
openalex +2 more sources
Pell graceful labeling of graphs [PDF]
Malaya Journal of Matematik, 2019 D. Muthuramakrishnan, S. Sutha
openalex +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
Relaxed Graceful Labellings of Trees [PDF]
The Electronic Journal of Combinatorics, 2002 A graph $G$ on $m$ edges is considered graceful if there is a labelling $f$ of the vertices of $G$ with distinct integers in the set $\{0,1,\dots,m\}$ such that the induced edge labelling $g$ defined by $g(uv)=|f(u)-f(v)|$ is a bijection to $\{1,\dots,m\}$. We here consider some relaxations of these conditions as applied to tree labellings: 1.
Frank Van Bussel
openalex +3 more sources
Graceful Labeling of Prime Index Graph of Group Zp × Zpn
Contemporary Mathematics, 2023 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
Ordered graceful labellings of the 2-star
Discrete Mathematics, 2001 AbstractA variation on the well-known graceful labelling problem for graphs is that of finding an ordered graceful labelling. A graceful labelling f:V(T)→{1,2,…,n} of a tree T of order n is called ordered graceful if, when the edges of the tree are oriented from the endvertex with larger label to the endvertex with smaller label, then every vertex has ...
Richard J. Nowakowski, Carol Whitehead
openalex +3 more sources
Graceful labeling construction for some special tree graph using adjacency matrix
Electronic Journal of Graph Theory and Applications, 2023 In 1967, Rosa introduced β − labeling which was then popularized by Golomb under the name graceful. Graceful labeling on a graph G is an injective function f : V ( G ) → { 0 , 1 , 2 , . . .
Nikson Simarmata +2 more
semanticscholar +1 more source
Encoding And Decoding Process Using Prime Graceful Labeling
Tuijin Jishu/Journal of Propulsion Technology, 2023 In this paper, an interesting application of Prime graceful labeling in the field of coding theory is examined. Here, a new algorithm for encoding and decoding blended with prime graceful labeling is constructed and an interpretation for the proposed ...
M. V. Nayana, K. R. Sobha
semanticscholar +1 more source
Graceful Labeling For bipartite graceful Graphs and related Graphs
, 2020 The concept of graceful labels was proposed by Rosa, scholars began to study graceful labels of various graphs and obtained relevant results.Let the graph is a bipartite graceful graph, we have proved some graphs are graceful labeling in this paper.
Liu Chun-feng, Xiuying Wang, Guozhu Liu
openalex +4 more sources