Results 1 to 10 of about 495 (90)
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
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. We show that complete graphs, complete bipartite graphs, gear graphs, triangular grid graphs, and wheel graphs ...
Kalpana Mahalingam +1 more
openalex +4 more sources
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 each edge uv e E(G) with u,v e V(G) in effect f(uv)=|f(u)-f(v)|.
Meliana Pasaribu +2 more
openalex +4 more sources
International Journal of Mathematics And Computer ResearchThe concept of graph labeling was introduced in mid-1960 by Rosa. In this paper, we introduce a notion of graceful labeling of a finite poset. We obtain graceful labeling of some postes such as a chain, a fence, and a crown. In 2002 Thakare, Pawar, and Waphare introduced the ‘adjunct’ operation of two lattices with respect to an adjunct pair of ...
A. N. Bhavale, Dheeraj Shelke
openalex +2 more sources
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
Super Fibonacci Graceful Labeling [PDF]
viXra, 2011 Approaching topics such as Smarandache-Fibonacci triple, graceful labeling, Fibonacci graceful labeling, super Smarandache-Fibonacci graceful graph, super Fibonacci graceful graph.
R. Sridevi +2 more
openalex +4 more sources
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 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
A note on the number of graceful labellings of paths
Discrete Mathematics, 2003 AbstractWith the help of a simple recursive construction we give a computer-assisted proof that the number of graceful labellings of a path of length n grows asymptotically at least as fast as (5/3)n. Results of this type have found surprising applications in topological graph theory.
R. E. L. Aldred +2 more
openalex +3 more sources
Pell graceful labeling of graphs [PDF]
Malaya Journal of Matematik, 2019 D. Muthuramakrishnan, S. Sutha
openalex +3 more sources