Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,612,595 papers from all fields of science
Search
Sign In
Create Free Account
Graceful labeling
Known as:
Graceful (disambiguation)
, Von Koch's conjecture
, Graceful tree conjecture
Expand
In graph theory, a graceful labeling of a graph with m edges is a labeling of its vertices with some subset of the integers between 0 and m inclusive…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
8 relations
Butterfly graph
Edge-graceful labeling
Friendship graph
Gerhard Ringel
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
On $k$-Super Graceful Labeling of Graphs
G. Lau
,
W. Shiu
,
Ho-Kuen Ng
2018
Corpus ID: 119602232
Let $G=(V(G),E(G))$ be a simple, finite and undirected graph of order $p$ and size $q$. For $k\ge 1$, a bijection $f: V(G)\cup E…
Expand
2013
2013
Graphs with Edge-Odd Graceful Labelings
S. Singhun
2013
Corpus ID: 125287579
Solairaju and Chithra [3] introduced a new type of labeling of a graph G with q edges called an edge-odd graceful lebeling if…
Expand
2013
2013
GRACEFUL LABELING OF HANGING THETA GRAPHS
T. N. Janakiraman
,
G. Sathiamoorthy
2013
Corpus ID: 55317238
In this paper, we introduce a new class of hanging theta graphs and prove that those graphs admit graceful labeling.
2012
2012
On d-graceful labelings
A. Pasotti
Ars Comb.
2012
Corpus ID: 5106543
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…
Expand
2011
2011
Super Fibonacci Graceful Labeling
R. Sridevi
,
K. Nagarajan
,
S. Navaneethakrishnan
2011
Corpus ID: 59246314
A Smarandache-Fibonacci Triple is a sequence S(n), n ≥ 0 such that S(n) = S(n−1)+S(n−2), where S(n) is the Smarandache function…
Expand
2011
2011
Some New Graceful Graphs
S. Vaidya
,
Lekha Bijukumar
2011
Corpus ID: 123962760
In this paper we show that the graphs obtained by duplication of an arbitrary vertex in cycle Cn as well as duplication of an…
Expand
2010
2010
Graceful Mirror-Staircase Graphs
A. Solairaju
,
M. Arockiasamy
2010
Corpus ID: 117728546
A Graceful labeling on a graph with p vertices and q edges is a one-to- one map taking the vertices into the integers {0,1,2…
Expand
2006
2006
Efficient enumeration of graceful permutations
Michał Adamaszek
2006
Corpus ID: 16165349
A graceful n-permutation is a graceful labeling of an n-vertex path P_n. In this paper we improve the asymptotic lower bound on…
Expand
2004
2004
MPLS multicasting using caterpillars and a graceful labelling scheme
A. Basak
Proceedings. Eighth International Conference on…
2004
Corpus ID: 15085362
In This work we describe MPLS (multi-protocol label switching) multicasting under a specific graph (graceful) labeling with the…
Expand
1982
1982
Construction of Certain Infinite Families of Graceful Graphs form a Given Graceful Graph
B. Acharya
1982
Corpus ID: 122180818
Two general methods of constructing an infinite sequence(G=G/sub1/,G/sub2/....) of graceful graphs Gi such that Gi is contained…
Expand