The following shows good promise and would be an extension of
2.8.
Conjecture 3.17
If
with
is a MSG, then
.
The following would be extension to work by [#!hs2!#] and [#!mrss!#].
Conjecture 3.18 when for and n even.
Conjecture 3.19 when for and n odd.
The following conjectures appear to be true, but seem difficult to
prove or disprove.
Conjecture 3.20
Let be a graph with
, then .
Conjecture 3.21
Let be a graph, then finding the mod
sum number is np-complete.
Conjecture 3.22
Let be a graph. There exist based on such that if G
is not MSG modulo then G is not a MSG.
BIBLIOGRAPHY
VITA
Christopher D. Wallace
111 Brown Road #26
Johnson City, TN 37615
Phone: (423)952-0545
PROFESSIONAL EXPERIENCE:
Math
Tutor, ETSU, Johnson City, TN, 1/95-8/98
Math Lab
Coordinator, ETSU, Johnson City, TN, 1/98-8/98
Math
Instructor, ETSU, Johnson City, TN, 8/98-present EDUCATION
B.S. with majors in Computer
Science and Math, and concentration in Physics, ETSU, 5/97
M.S. in Mathematical Science, ETSU, 5/99
Graduate
Student in Computer Science, ETSU, 8/97-present PRESENTATIONS:
Progress on Mod Sum Graphs,
at the 936 AMS Meeting, Wake Forest University, October
9-10, 1998 HONORS AND AWARDS
Hall of Fame in Computer Science, ETSU, 1994-1997
Outstanding Mathematics Senior, 1996, ETSU
Outstanding
Mathematics Senior, 1997, ETSU
Runner Up for
Outstanding Undergraduate in Computer Science, 1997, ETSU
Graduated 1997, ETSU
Graduating 1999, ETSU
Member of Gamma Beta, Kappa Mu Epsilon, Phi Kappa Phi,
and Upsilon Pi Upsilon Honor Societies Next:About this document ... Up:CHAPTER 3 CONCLUSIONS and Previous:Conclusions
  Contents
root
2003-11-05