Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 231,270,912 papers from all fields of science
Search
Sign In
Create Free Account
Edge-graceful labeling
Known as:
Graceful (disambiguation)
In graph theory, an edge-graceful graph labeling is a type of graph labeling. This is a labeling for simple graphs in which no two distinct edges…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
7 relations
Friendship graph
Graceful labeling
Graph labeling
Graph theory
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
On Edge-Graceful Regular Graphs with Particular 3-Factors
Tao-Ming Wang
,
Guanglian Zhang
Electron. Notes Discret. Math.
2017
Corpus ID: 32840107
2016
2016
Edge-Graceful Labelings of Connected Graphs
K. Kayathri
,
R. Amutha
Electron. Notes Discret. Math.
2016
Corpus ID: 29643712
2015
2015
Tight super-edge-graceful labelings of trees and their applications
Alex Collins
,
Colton Magnant
,
Hua Wang
AKCE Int. J. Graphs Comb.
2015
Corpus ID: 54516517
2011
2011
Modular Edge-Graceful Trees
Ryan C. Jones
2011
Corpus ID: 7337882
Ryan Jones, Western Michigan University We introduce a modular edge-graceful labeling of a graph a dual concept to the common…
Expand
2010
2010
Super edge-graceful labelings of complete bipartite graphs
A. Khodkar
,
Sam Nolen
,
James T. Perconti
The Australasian Journal of Combinatorics
2010
Corpus ID: 12885493
Let [n]∗ denote the set of integers {−n−1 2 , . . . , n−1 2 } if n is odd, and {−n 2 , . . . , n 2 } \ {0} if n is even. A super…
Expand
2010
2010
k-even edge-graceful labeling of the graph Pn @ K1,m
S. Devi
,
B. Gayathri
2010
Corpus ID: 118176988
In 1985, Lo[6] introduced the notion of edge-graceful graphs. In [2], Gayathri et al., introduced the even edge-graceful graphs…
Expand
2007
2007
All Trees of odd order with three even vertices are super edge-graceful
Sin-Min Lee
2007
Corpus ID: 15561746
A (p,q)-graph G is said to be edge graceful if the edges can be labeled by 1,2, ...• q so that the vertex sums are distinct, mod…
Expand
2000
2000
Supermagic labeling, edge-graceful labeling and edge-magic index of graphs
Hee Lin Cheng
2000
Corpus ID: 125727834
1980
1980
Two sets of graceful graphs
C. Delorme
Journal of Graph Theory
1980
Corpus ID: 32527143
We give graceful numberings to the following graphs: (a) the union of n K4 having one edge in common, in other words the join of…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE