Edge-graceful Labeling
In graph theory, an edge-graceful graph labeling is a type of graph labeling. This is a labeling for simple graphs, namely ones in which no two distinct edges connect the same two distinct vertices, no edge connects a vertex to itself, and the graph is connected. Edge-graceful labelings were first introduced by S. Lo in his seminal paper.
Read more about Edge-graceful Labeling: Definition, A Necessary Condition, Further Selected Results
Famous quotes containing the word labeling:
“Although adults have a role to play in teaching social skills to children, it is often best that they play it unobtrusively. In particular, adults must guard against embarrassing unskilled children by correcting them too publicly and against labeling children as shy in ways that may lead the children to see themselves in just that way.”
—Zick Rubin (20th century)