Further Selected Results
- The Petersen graph is not edge-graceful.
- The star graph (a central node and m legs of length 1) is edge-graceful when m is even and not when m is odd.
- The friendship graph is edge-graceful when m is odd and not when it is even.
- Regular trees, (depth n with each non-leaf node emitting m new vertices) are edge-graceful when m is even for any value n but not edge-graceful whenever m is odd.
- The complete graph on n vertices, is edge-graceful unless n is singly even, .
- The ladder graph is never edge-graceful.
Read more about this topic: Edge-graceful Labeling
Famous quotes containing the words selected and/or results:
“She was so overcome by the splendor of his achievement that she took him into the closet and selected a choice apple and delivered it to him, along with an improving lecture upon the added value and flavor a treat took to itself when it came without sin through virtuous effort. And while she closed with a Scriptural flourish, he “hooked” a doughnut.”
—Mark Twain [Samuel Langhorne Clemens] (1835–1910)
“We do not raise our children alone.... Our children are also raised by every peer, institution, and family with which they come in contact. Yet parents today expect to be blamed for whatever results occur with their children, and they expect to do their parenting alone.”
—Richard Louv (20th century)