On The Edge-Graceful and Edge-Magic Maximal Outerplanar Graphs Sin-Min Lee, Medei Kitagaki, Joseph...
-
date post
21-Dec-2015 -
Category
Documents
-
view
219 -
download
4
Transcript of On The Edge-Graceful and Edge-Magic Maximal Outerplanar Graphs Sin-Min Lee, Medei Kitagaki, Joseph...
On The Edge-Graceful and Edge-Magic Maximal Outerp
lanar Graphs
Sin-Min Lee , Medei Kitagaki, Joseph Young
Department of Computer Science
San Jose State University
San Jose, California 95192 U.S.A.
William KocayDepartment of Computer Science
University of Manitoba
Winnipeg, Canada R3T 2N2
Definition of edge-graceful
Definition 1 An edge-graceful labeling of a graph G with p vertices and q edges is a one-to-one correspondence f from E(G) to {1, 2, . . ., q} such that for all vertices v, the vertex sums are distinct, mod p.
A graph G is called edge-graceful if there exists an edge-graceful labeling of G.
Concept Introduced by: Lo Sheng -Ping
A necessary condition of edge-gracefulness is:
q(q+1) p(p-1)/2(mod p)
This condition may be more practically stated as q(q+1) 0 or p/2 (mod p) depending on whether p is
odd or even.
Lee proposed the following tantalizing conjectures:
Conjecture 1: The Lo condition (2) is sufficient for a connected graph to be edge-graceful.
A sub-conjecture of the above that has not yet been proved:
Conjecture 2: All odd-order trees are edge-graceful.
Lemma Let G be a maximal outerplanar graph with n vertices, n≥3, then(i) there are 2n-3 edges, in which there are n-3 chords;(ii) there are n-2 inner faces. Each inner face is triangular;(iii) there are at least two vertices with degree 2;
Theorem. A maximal outerplanar graph with p vertices is edge-graceful if p = 4 and 12.
Proof. A maximal outerplanar graph with p vertices has 2p-3 edges. It is edge-graceful if it satisfies the Lo’s condition
q(q+1) p(p-1)/2 (mod p)
(2p-3)(2p-2) p(p-1)/2 (mod p)
(4p-6)(p-1) p(p-1)/2 (mod p)
4p-6 p/2 (mod p)
Thus p is even, say p = 2k. We have 7k 6 (mod 2k), i.e. k 6 (mod 2k).
From which we have k = 2 or k = 6. Thus p = 4 or 12.
Our true task: To show there exists an edge-graceful labeling for every maximal outerplanar graph with p = 12 vertices.
Bob – There is only 1 unique graph for p = 4, but
HOW MANY ARE THERE FOR p = 12?
Alice – Just draw every single graph and count.
Bob - HOW DO WE ENSURE WE HAVE ALL THE GRAPHS?
GENERATING MAXIMAL OUTERPLANAR GRAPHS
“The Idea”
Notice that given any MOP with n vertices, we can construct a new MOP with n + 1 vertices by simply adding a triangle on one of the outer edges.
n = 6 n = 7
GENERATING MAXIMAL OUTERPLANAR GRAPHS
“The Algorithm Skeleton”
While(n < 12)
{ While(more graphs of n vertices)
While(i < n - 1)
{ Add new vertex connected to vertex i and i+1
increment i
Store new graph of n+1
}
Add a new vertex connecting vertex 1 and n
Store new graph of n+1
}
*Sort out duplicates from stored set of graphs of n+1
}
*The algorithm generates many unnecessary, isomorphic graphs.
At each stage in the generation process - for each set of MOP's with n vertices generated - we must some how sort out and eliminate duplicates.
Professor William Kocay's 'Groups and Graphs' software exploits Automorphism to sort out from a set of graphs all the duplicates.
While(n < 12)
{ While(more graphs of n vertices)
While(i < n - 1)
{ Add a new vertex connected to vertex i and i+1
increment i
Store new graph of n+1
}
Add a new vertex connecting vertex 1 and n
Store new graph of n+1
}
*Feed graphs through 'Groups and Graphs'
}
GENERATING MAXIMAL OUTERPLANAR GRAPHS
“The Algorithm Revised”
CONCLUSION: That is a lot of permutations.
Now that we have all the graphs we needed, we must find an edge-graceful labeling for each graph.
-For MOP's with 12 vertices, there are 21 edges.
-There are 733 MOP's with 12 vertices.
-There are 21! Possible ways to label(weigh) the edges.
-To find edge-graceful labelings, we search through every permutation of edge-weight labels.
The task of finding edge-graceful labels becomes a problem of complexity.
To minimize overhead time, we use the iterative version of Sedgewick's heap method algorithm to generate permutations.
To test every permutation sequentially is unsound, considering the following empirical result:
Expected time to find a labeling for a graph:
About 3 days.
Empirical result was inferred from a small data set - some graphs we ran sequentially - but a better method is desirable.
(There are 733 graphs!)
Solution: Exploit the nature of our software
-The order in which the edges are input matters.
-If an edge-graceful label is not found after a few thousand permutations, randomize the input and try again.
Theorem. The maximal outerplanar graph with 12 vertices are edge-graceful.
1
9
46
03
711
5
28
10
v1
v2
v3
v4
v5
v6v7
v8
v9
v10
v11
v125
1
47
112
610
3
08
9
v1
v2
v3
v4
v5
v6v7
v8
v9
v10
v11
v12
M1M2
27
20
5
17
3
10
12
19
418
14
13
11
61615
821
9
1
1
10
12
19
13
218
14
3
17
4
20
6
9
21
815
5
16 7
2
0
67
43
511
9
110
8
v1
v2
v3
v4
v5
v6v7
v8
v9
v10
v11
v12 7
1
46
32
911
5
108
0
v1
v2
v3
v4
v5
v6v7
v8
v9
v10
v11
v12
M3M4
1
2
3
4
5
9
1112
13
14
15 1617
18
19
20
7 6
10
12
3
4
56
7
8
910
11 12
13
14
15
16
17
18
19
20
21
0
8
2 6
43
711
1
59
10
v1
v2
v3
v4
v5
v6v7
v8
v9
v10
v11
v12
M5
1
4
27
03
510
9
116
8
v1
v2
v3
v4
v5
v6v7
v8
v9
v10
v11
v12
M6
1
2
3
4
5
67
8
910
1112
13
14
151617
18
19
20
21
1
2
3
4
5
6
7
8
9 10
1112
13
14
15
16
17
18
19
20
21
9
8
53
410
711
2
60
1
v1
v2
v3
v4
v5
v6v7
v8
v9
v11
v12
M7
5
11
03
64
19
10
28
7
v1
v2
v3
v4
v5
v6v7
v8
v9
v10
v11
v12
M8
v10
1
2
3
4
5
6
78
9
10
11
12
13
1415
16
17
18
19
20
21
12 3
4
5
6
7
8
910
11
12
13
1415
16
17
18
19
20
21
7
2
13
510
611
4
09
8
v1
v2
v3
v4
v5
v6v7
v8
v9
v11
v12
M9
8
0
103
54
79
1
116
2
v1
v2
v3
v4
v5
v6v7
v8
v9
v10
v11
v12
M10
v10
1
2
34
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
1
2
3
4
5
6
7
8
9
10
11
12
13
14
1516
17
18
19
20
21
5
4
23
611
710
1
09
8
v1
v2
v3
v4
v5
v6v7
v8
v9
v10
v11
v12
M12
11
10
43
21
50
9
68
7
v1
v2
v3
v4
v5
v6v7
v8
v9
v10
v11
v12
M11
1
2
3
4
5
6
7
8
9 10
11
12
13
14
15
16
17
1819
20
21
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
1819
20
21
2
5
13
410
811
9
76
0
v1
v2
v3
v4
v5
v6v7
v8
v9
v10
v11
v12
M14
0
7
113
510
89
4
16
2
v1
v2
v3
v4
v5
v6v7
v8
v9
v10
v11
v12
M13
1
2
3
4
5
6
7
8
9
10
11
12
13
14
1516
17
18
19
20
211
2
3
4
5
6
7
8
9
10
11
12
13
1415
16
17
1819
20
21
Sin-Min Lee, E. Seah and S.K. Tan , On edge-magic graphs, Congressus Numerantium 86 (1992), 179-191.
The dual concept of edge-graceful graphs was introduced in 1992.
Let G be a (p,q) graph in which the edges are labeled 1,2,3,...q so that the vertex sums are constant, mod p. Then G is said to be edge-magic..
A necessary condition for a (p,q)-graph to be edge-magic is q(q+1) 0 (mod p).
However, this condition is not sufficient.
Examples:
(1)Trees
(2)Cycles
Theorem. A maximal outerplanar graph with p vertices is edge-magic if p= 6.
Proof. A maximal outerplanar graph with p vertices is edge-magic if it satisfies
q(q+1)0 (mod p)
(2p-3)(2p-2) 0 (mod p)
(4p-6)(p-1) 0 (mod p)
4p-6 0(mod p)
6 0(mod p)
Thus p is 6.