|
|
| Line 1: |
Line 1: |
| In [[graph theory]], an '''edge-graceful''' graph labeling is a type of [[graph labeling]]. This is a labeling for [[simple graph]]s in which no two distinct [[edge (graph theory)|edge]]s connect the same two distinct [[Vertex (graph theory)|vertices]], no edge connects a vertex to itself, and the graph is [[Connected graph|connected]]. Edge-graceful labelings were first introduced by S. Lo in his seminal paper.<ref>Lo (1985)</ref>
| | Hello. Let me introduce the author. Her title is Refugia Shryock. For years I've been operating as a payroll clerk. South Dakota is exactly where I've always been residing. The preferred pastime for my kids and me is to perform baseball but I haven't produced a dime with it.<br><br>Feel free to surf to my page ... [http://www.dresdenchurch.net/zbxe/?document_srl=1218414 www.dresdenchurch.net] |
| | |
| == Definition ==
| |
| | |
| Given a graph ''G'', we denote the set of edges by ''E''(''G'') and the vertices by ''V''(''G''). Let q be the [[cardinality]] of ''E''(''G'') and ''p'' be that of ''V''(''G''). Once a labeling of the edges is given, a vertex ''u'' of the graph is labeled by the sum of the labels of the edges incident to it, modulo ''p''. Or, in symbols, the induced labeling on the vertex ''u'' is given by
| |
| | |
| :<math>V(u)=\Sigma E(e) \mod |V(G)|</math>
| |
| where ''V''(''u'') is the label for the vertex and ''E''(''e'') is the assigned value of an edge incident to ''u''. | |
| | |
| The problem is to find a labeling for the edges such that all the labels from 1 to ''q'' are used once and the induced labels on the vertices run from 0 to ''p'' − 1. In other words, the resulting set for labels of the edges should be <math>\{1,2 \dots q\}</math> and <math>\{0,1 \dots p-1\}</math> for the vertices. | |
| | |
| A graph ''G'' is said to be edge-graceful if it admits an edge-graceful labeling.
| |
| | |
| == Examples ==
| |
| === Paths ===
| |
| | |
| Consider a [[path (graph theory)|path]] with two vertices, ''P''<sub>2</sub>. Here the only possibility is to label the only edge in the graph 1. The induced labeling on the two vertices are both 1. So ''P''<sub>2</sub> is not edge-graceful.
| |
| | |
| Appending an edge and a vertex to ''P''<sub>2</sub> gives ''P''<sub>3</sub>, the path with three vertices. Denote the vertices by ''v''<sub>1</sub>, ''v''<sub>2</sub>, and ''v''<sub>3</sub>. Label the two edges in the following way: the edge (''v''<sub>1</sub>, ''v''<sub>2</sub>) is labeled 1 and (''v''<sub>2</sub>, ''v''<sub>3</sub>) labeled 2. The induced labelings on ''v''<sub>1</sub>, ''v''<sub>2</sub>, and ''v''<sub>3</sub> are then 1, 0, and 2 respectively. This is an edge-graceful labeling and so ''P''<sub>3</sub> is edge-graceful.
| |
| | |
| Similarly, one can check that ''P''<sub>4</sub> is not edge-graceful.
| |
| | |
| In general, ''P''<sub>m</sub> is edge-graceful when ''m'' is odd and not edge-graceful when it is even. This follows from a necessary condition for edge-gracefulness (see below).
| |
| | |
| === Cycles ===
| |
| | |
| Consider the [[cycle graph|cycle]] with three vertices, ''C''<sub>3</sub>. This is simply a triangle. One can label the edges 1, 2, and 3, and check directly that, along with the induced labeling on the vertices, this gives an edge-graceful labeling.
| |
| | |
| Similar to paths, <math>C_m</math> is edge-graceful when ''m'' is odd and not when ''m'' is even.
| |
| | |
| An edge-graceful labeling of <math>C_5</math> is shown in the following figure:
| |
| | |
| [[Image:Edge graceful c5.svg]]
| |
| | |
| == A necessary condition ==
| |
| | |
| Lo gave a necessary condition for a graph to be edge-graceful. It is that a graph with ''q'' edges and ''p'' vertices is edge graceful only if
| |
| | |
| :<math>\; q(q+1)</math> is [[Congruence relation#modular arithmetic|congruent]] to <math>\frac{p(p-1)}{2}</math> modulo ''p''.
| |
| | |
| or, in symbols,
| |
| | |
| :<math>q(q+1) \equiv \frac{p(p-1)}{2} \mod p.</math> | |
| | |
| This is referred to as '''Lo's condition''' in the literature. This follows from the fact that the sum of the labels of the vertices is twice the sum of the edges, modulo ''p''. This is useful for disproving a graph is edge-graceful. For instance, one can apply this directly to the path and cycle examples given above.
| |
| | |
| == Further selected results ==
| |
| | |
| *The [[Petersen graph]] is not edge-graceful.
| |
| | |
| *The [[star graph]] <math>S_m</math> (a central node and ''m'' legs of length 1) is edge-graceful when ''m'' is [[even number|even]] and not when ''m'' is [[odd number|odd]].
| |
| | |
| *The [[friendship graph]] <math>F_m</math> is edge-graceful when ''m'' is odd and not when it is even.
| |
| | |
| *[[Regular tree]]s, <math>T_{m,n}</math> (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, <math>K_n</math>, is edge-graceful unless ''n'' is [[singly even]], <math>n=2\mod 4</math>.
| |
| | |
| *The [[ladder graph]] is never edge-graceful.
| |
| | |
| == References ==
| |
| {{reflist}}
| |
| * {{cite journal | zbl=0597.05054 |last=Lo | first=Sheng-Ping | title=On edge-graceful labelings of graphs |
| |
| conference=Proc. Conf., Sundance/Utah 1985 | journal=Congressus Numerantium | volume=50 | year=1985 | pages=231–241 }}
| |
| * Q. Kuan, S. Lee, J. Mitchem, and A. Wang, ''On Edge-Graceful Unicyclic Graphs'', Congressus Numerantium 61(1988) pp. 65–74
| |
| * L. Lee, S. Lee and G. Murty, ''On Edge-Graceful Labelings of Complete Graphs: Solutions of Lo’s Conjecture'', Congressus Numerantium 62(1988) pp. 225–233
| |
| * D. Small, ''Regular (even) Spider Graphs are Edge-Graceful'', Congressus Numerantium 74(1990) pp. 247–254
| |
| * S. Cabaniss, R. Low, J. Mitchem, ''On Edge-Graceful Regular Graphs and Trees'', Ars Combinatoria 34(1992) pp. 129–142
| |
| | |
| {{DEFAULTSORT:Edge-Graceful Labeling}}
| |
| [[Category:Graph theory]]
| |
Hello. Let me introduce the author. Her title is Refugia Shryock. For years I've been operating as a payroll clerk. South Dakota is exactly where I've always been residing. The preferred pastime for my kids and me is to perform baseball but I haven't produced a dime with it.
Feel free to surf to my page ... www.dresdenchurch.net