Location model - Revision history

192.76.8.27: /* Assumptions */

2014-10-30T00:34:19Z

Assumptions

← Older revision		Revision as of 02:34, 30 October 2014
Line 1:		Line 1:
	~~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~~]		Hi there. Allow me begin by introducing the author, her title is Myrtle Cleary. Managing people is his profession. The [http://Blog.catherinecoaches.com/2011/11/the-hollywood-herpes-tree-celebrities-who-have-herpes-allegedly.html favorite hobby] for my kids and over the counter std test me is to play baseball and I'm trying to make it a profession. [http://Www.Herpes.org/smart-living-with-genital-herpes/ Minnesota] has always been his std home test home but his wife desires std testing at home them to transfer.<br><br>My web page ... at home std testing ([http://iconi.org/2010/xe/?mid=Notice&sort_index=regdate&order_type=desc&document_srl=207009 simply click the following page])

en>Gary: f

2013-03-17T23:23:21Z

← Older revision		Revision as of 01:23, 18 March 2013
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]~~]

en>Gary King: f

2013-03-17T23:23:21Z

Show changes

en>Headbomb: Various citation cleanup (identifiers mostly), replaced: | id = {{jstor|3003323}} → | jstor = 3003323, typos fixed: , → , using AWB

2011-08-31T06:53:34Z

Various citation cleanup (identifiers mostly), replaced: | id = {{jstor|3003323}} → | jstor = 3003323, typos fixed: , → , using AWB

New page

The very best thing about technology is that you can play your preferred game without leaving the house. All that you require to have is [http://www.purevolume.com/abbyaxvdulfl/posts/6931058/How+To+Learn+Spilleautomater norske automater kungen nett] an active internet link and a pc. Many individuals enjoy casino video games so a lot whether or not it is at their local casino or in a ship cruising. A fantastic recommendation is to verify out other popular casino websites and see what they have to provide. The much more game selection your casino [http://www.purevolume.com/traciemcelhaney/posts/6635210/Choosing+Spilleautomat norske spilleautomater gällande nett] site offers the much better off it will be. To truly have a popular online casino website you will need to provide as many video games and the like as possible. Then, match what they offer or even better go above and beyond it. " and dances wildly around the stool where you are sitting. You are in a daze as the casino supervisor arrives more than to confirm that you did certainly win. Dumbfounded, you sit and stare at the device. You have gained the jackpot, and it is a large 1, a million bucks! Your friend operates up, yelling, "You won! He then congratulates you, and asks that you follow him to the on line casino offices in purchase to sign some papers and organize to receive your winnings. Suddenly, it dawns on you - the jackpot. You break into a grin as applause follows you till you stage out of the [http://www.Reddit.com/r/howto/search?q=primary primary] on line casino region. Now, you are very glad your buddy persuaded you to invest a couple of hours at the casino! Of program one can probably get, or perhaps win a lot. Small do they understand that nearly everything heading on in any casino game is random. Many people who arrive to the casinos with profit in thoughts think winning in video games of opportunity can be easy. Some simply lose and even go bankrupt, becoming another victim of the rather inevitable bad luck. This can be activated by clicking the Automobile button [http://www.fizzlive.com/member/1212915/blog/view/3495129 casino spilleautomater] discovered at the game panel and select the number of spins that you want. After setting up, strike the [http://Photobucket.com/images/Spin+button Spin button] then the reels will start to spin according to the quantity [http://www.purevolume.com/fannylaroseavotou/posts/6635252/What+You+Don%27t+Know+About+Spilleautomater+Norske+Could+Be+Costing+To+More+Than+You+Think norskeautomater] of spins that you have chosen. It allows the participant to set the slots device [https://www.rebelmouse.com/chrismahmood/in-10-minutes-ill-give-you-the-672891956.html beste spilleautomater på nett] to play immediately primarily based on the quantity of spins selected. Their winning combinations and their corresponding payouts can be noticed on the slots Paytable. Autoplay Feature is also integrated on the slots game. Lucky 8 Line slots sport has regular [http://www.purevolume.com/shennaharley/posts/6893228/A+Guide+To+Ble+Spilleautomater+Til+En+Stor+Suksess norske automater] symbols. You are about to see three proven techniques that will get your ex to return your telephone calls. Right here is how you can pull your ex back again as soon as and for all. Do you really want to hear your ex's voice once more? Do you miss your ex like crazy and want to get your ex [http://www.purevolume.com/fannylaroseavotou/posts/6835080/The+Secret+To+Les+V%C3%A5re+Artikler+Og+Bli+En+Mester+P%C3%A5+Spilleautomater norske automater kungen nett] back again? Well you have strike the jackpot then! Does your ex not return your telephone calls?