Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
2016
2016
2011
2011
Ryan Jones, Western Michigan University We introduce a modular edge-graceful labeling of a graph a dual concept to the common… 
2010
2010
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… 
2010
2010
In 1985, Lo[6] introduced the notion of edge-graceful graphs. In [2], Gayathri et al., introduced the even edge-graceful graphs… 
2007
2007
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… 
1980
1980
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…