Edge-graceful Labeling

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

Other articles related to "labeling":

Graph Labeling - Special Cases - Edge-graceful Labeling
... An edge-graceful labeling on a simple graph (no loops or multiple edes) on p vertices and q edges is a labelling of the edges by distinct integers in {1...q} such that the labeling on the vertices induced by ... A graph G is said to be edge-graceful if it admits an edge-graceful labeling ... Edge-graceful labelings were first introduced by S ...
Edge-graceful Labeling - 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 ...

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)