% Begin of file
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% Encoding: ASCII
% Tex format: LaTeX
% Last modified: August 5, 2003
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

% Make it visible in table of contents
\addcontentsline{toc}{section}{References}

\begin{thebibliography}{888}
\bibitem{Abh} V. J. Abhyankar, Direct methods of gracefully labeling 
graphs, Ph.D thesis, University of Mumbai, 2002. 
\bibitem{AB2} V. J. Abhyankar and V. N. Bhat-Nayak, Easiest graceful labeling
of olive trees, {\it Bull., Bombay Math. Coll.}, {\bf 14} (2000) 16-25.
\bibitem{AB1} V. J. Abhyankar and V. N. 
Bhat-Nayak, personal communication.
\bibitem{Ab} J. Abrham, Perfect systems of difference sets--A survey, 
{\it Ars Combin.,} {\bf 17A} (1984) 5--36.
\bibitem{Ab2} J. Abrham, Graceful 
$2$-regular graphs and Skolem sequences,
{\it Discrete Math.}, {\bf 93} (1991) 115--121.
\bibitem{ACE} J. Abrham, M. Carter and K. Eshghi, personal communication. 
\bibitem{AK1} J. Abrham and A. Kotzig, Extensions of graceful valuations 
of 2-regular graphs consisting of 4-gons,
 {\it Ars Combin.,} {\bf 32} (1991) 257-262. 
\bibitem{AK2} J. 
Abrham and A. Kotzig, Two 
sequences of 2-regular graceful graphs consisting of 4-gons, 
in J. Nesetril and M. Fiedler, eds., 4th Czechoslovakian Symp. on 
Combinatorics, Graphs, and Complexity (Elsevier, Amsterdam, (1992) 1--14. 
\bibitem{AK3} J. Abrham and A. Kotzig, 
All 2-regular graphs consisting of 4-cycles are graceful,
{\it Discrete Math.}, {\bf 135} (1994) 1--14.
\bibitem{AK4} J. 
Abrham and A. Kotzig, Graceful valuations of 2-regular graphs with two 
components, {\it Discrete Math.}, {\bf 150} (1996) 3-15. 
\bibitem{A1} B.D. Acharya, On $d$-sequential graphs, {\it {J. Math. Phy. 
Sci.}}, {\bf {17}} (1983) 21-35.
\bibitem{A2} B.D. Acharya, Set valuations of a  graph and their 
applications, MRI Lecture Notes in Applied Mathematics, No. 2, Mehta 
Research Institute, Allahabad, 1983.
\bibitem{A3} B. D. Acharya, Are all polyminoes arbitrarily graceful?,
{\it Proc. First Southeast Asian Graph Theory Colloquium},
Ed.\ K. M. Koh and H. P. Yap, Springer-Verlag, N. Y. 1984, 205-211.
\bibitem{AcBh} M. Acharya and V. Bhat-Nayak, Minimal $4$-equitability of 
$C_{2n}OK_1$, {\it Ars Combin.,} {\bf 65} (2002) 209--236.
\bibitem{AG} B. D. Acharya and M. K. Gill, On the index of gracefulness
of a graph and the gracefulness of two-dimensional square lattice graphs,
{\it Indian J. Math.,} {\bf 23} (1981) 81-94.
\bibitem{AH1}  B.D. Acharya and S.M. Hegde,  
Further results on $k$-sequential graphs, {\it Nat. 
Acad. Sci. Lett.,} {\bf 8} (1985) 119-122.
\bibitem{AH2} B.D. Acharya and S.M. Hegde, Set sequential  graphs, 
{\it  Nat.Acad. Sci. Lett.,} {\bf 8} (1985) 387--390.
\bibitem{AH3} B.D. Acharya and S.M. Hegde, Arithmetic graphs, {\it {J. 
Graph Theory}}, {\bf {14}} (1990) 275-299.
\bibitem{AH4} B.D. Acharya and S.M. Hegde, Strongly indexable graphs, 
{\it{Discrete Math.}}, {\bf 93} (1991) 123-129.
\bibitem{AdSo} C. Adiga and D.  Somashekara,
Strongly $\star$-graphs, {\it Math. Forum,} {\bf 13} (1999/00) 31--36.
\bibitem{AlM} R.E. L. Aldred and B. D. McKay, Graceful and harmonious
labellings of trees, preprint.
\bibitem{ASS} R.E.L. Aldred, 
\v{S}ir\'{a}\v{n} 
and \v{S}ir\'{a}\v{n},
 A note on the number of 
graceful labelings of paths, {\it Discrete Math.,} {\bf 261} (2003) 27-30.
\bibitem{AKLRY} N. Alon, G. Kaplan, A. Lev, Y. Roditty and R. Yuster, 
Dense graphs are antimagic, preprint.  
\bibitem{AlSc} N. Alon and E. Scheinerman, Generalized sum graphs, 
{\it Graphs and Combin.,} {\bf 8} (1992) 23-29.
\bibitem{ABL1} M. Andar, S. Boxwala and N. Limaye, Cordial labelings of
some wheel related graphs, {\it J. Combin. Math. Combin. Comput.,} 
{\bf 41} (2002) 203-208.
\bibitem{ABL3} M. Andar, S. Boxwala and N. Limaye, 
On the cordiality of the $t$-uniform homeomorphs--I,  {\it Ars Combin.}, 
{\bf 66} (2003) 313-318.
\bibitem{ABL4}M. Andar, S. Boxwala and N. Limaye, 
 On the cordiality of the $t$-uniform homeomorphs--II (Complete graphs),  
{\it Ars Combin.}, {\bf 67} (2003) 213-220.
\bibitem{ABL2} M. Andar, S. Boxwala and N. Limaye, A note on cordial
labelings of multiple shells, {\it Trends Math.,} (2002) 77-80. 
\bibitem{ABL5}M. Andar, S. Boxwala and N. Limaye, 
On the cordiality of corona graphs, preprint.
\bibitem{ABL6}M. Andar, S. Boxwala and N. Limaye,
On the cordiality of the $t$-ply $P_t(u,v)$, preprint. 
\bibitem{AM} R. Aravamudhan and M. Murugan, Numbering of the vertices 
of $K_{a,1,b}$, preprint.
\bibitem{ArG} S. Arumugam and K. Germina, On indexable graphs, {\it 
Discrete Math.}, {\bf 161} (1996) 285-289.
\bibitem{AJV} S. Avadayappan, P. Jeyanthi and R. Vasuki, Super magic 
strength of a graph, {\it  Indian J. Pure Appl. Math.,} {\bf 32} (2001)
 1621-1630. 
\bibitem{AF} J. Ayel and O. 
Favaron, Helms are graceful,
 {\it Progress in Graph Theory}
(Waterloo, Ont., 1982), Academic Press, Toronto, Ont. (1984) 89-92.
\bibitem{BBR} J. Babujee, J. Baskar and N. Rao,
Edge-magic trees,
{\it Indian J. Pure Appl. Math.,} {\bf 33} (2002) 1837--1840.
\bibitem{Bac1} M. Ba\v{c}a, On magic and consecutive labelings for the
special classes of plane graphs, {\it Utilitas Math.,} {\bf 32} (1987)
59--65.
\bibitem{Bac2} M. Ba\v{c}a, Labelings of $m$-antiprisms,  {\it Ars
Combin.} {\bf 28} (1989) 242-245.
\bibitem{Bac8} M. Ba\v{c}a, On magic labelings of M\"{o}bius ladders,
{\it J. Franklin  Inst.,} {\bf 326} (1989) 885-888. 
\bibitem{Bac12} M. Ba\v{c}a, On magic labelings of type $(1,1,1)$ for
three  classes of plane graphs,
{\it Math. Slovaca,} {\bf 39} (1989) 233-239.
\bibitem{Bac14} M. Ba\v{c}a, On magic labelings of $m$-prisms,
{\it Math. Slovaca,} {\bf 40} (1990) 11-14. 
\bibitem{Bac9} M. Ba\v{c}a, On consecutive labelings of plane graphs, 
{\it J. Franklin  Inst.,} {\bf 328} (1991) 249-253.
\bibitem{Bac3} M. Ba\v{c}a, On magic labelings of honeycomb, {\it
Discrete Math.,} {\bf 105} (1992) 305--311.
\bibitem{Bac4} M. Ba\v{c}a, On magic labelings of grid
 graphs, {\it Ars Combin.,} {\bf 33} (1992) 295--299.
\bibitem{Bac11} M. Ba\v{c}a, On magic labelings of type $(1,1,1)$ for
the special class of plane graphs,
{\it J. Franklin  Inst.,} {\bf 329} (1992) 549-553.
\bibitem{Bac13} M. Ba\v{c}a, On magic labelings of convex polytopes,
{\it Ann. Disc. Math.,} {\bf 51} (1992) 13-16.
\bibitem{Bac10} M. Ba\v{c}a, Labelings of two classes of plane graphs,
{\it Acta Math. Appl. Sinica,} {\bf 9} (1993) 82-87. 
\bibitem{Bac6} M. Ba\v{c}a, Face antimagic labelings of convex polytopes, 
{\it Utilitas Math.,} {\bf 55} (1999)  221--226.
\bibitem{Bac5} M. Ba\v{c}a, Antimagic labelings of antiprisms, 
  {\it J. Combin. Math. Combin. Computing,} 
 {\bf 58} (2000) 237-241.
\bibitem{Bac7} M. Ba\v{c}a, Special face numbering of plane quartic
graphs, {\it Ars Combin.,} {\bf 57} (2000) 285-292. 
\bibitem{BBM} M. Ba\v{c}a, B. Baskoro and M. Miller, On $d$-antimagic 
labelings of honeycomb, preprint.
\bibitem{BBMMSS1} M. Ba\v{c}a, F. Bertault, J. MacDougall, M. Miller, R. 
Simanjuntak and Slamin, Vertex-antimagic total labelings of graphs, 
{\it Discuss. Math. Graph Theory,} {\bf 23} (2003) 67--83.
\bibitem{BBMMSS2} M. Ba\v{c}a, F. Bertault, J. MacDougall, M. Miller, R. 
Simanjuntak and Slamin, Vertex-antimagic total labelings of $(a,d)$-antimagic 
and $(a,d)$-face antimagic graphs, preprint.
\bibitem{BHo1} M. Ba\v{c}a and I. Holl\"ander,
On $(a,d)$-antimagic prisms,
{\it Ars Combin.,} {\bf 48} (1998) 297--306.
\bibitem{BHo2} M. Ba\v{c}a and I. Holl\"ander, Labelings of a certain
class of convex polytopes, {\it J. Franklin Inst.,} {\bf 329} (1992)
539-547.
\bibitem{BHo3} M.  Ba\v{c}a and I.  Holl\"ander, On $(a,b)$-consecutive
Petersen graphs, {\it Acta Math. Appl. Sinica (English Ser.),}
{\bf 14} (1998) 265--270.
\bibitem{BHL} M. Ba\v{c}a,  I. Holl\"ander 
and K.W. Lih, Two classes of
super-magic quartic graphs,  {\it J. Combin. Math. Combin. Computing,} 
 {\bf 23} (1997) 113--120.
\bibitem{BLM} M. Ba\v{c}a, Y. Lin and M. Miller, Valuations of plane quartic 
graphs,  {\it J. Combin. Math. Combin. Computing},  41 (2002) 209-221.
\bibitem{BLMS} M. Ba\v{c}a, Y. Lin, M. Miller and R. Simanjuntak,
New constructions of magic and antimagic graph labelings, {\it Utilitas 
Math.,}
{\bf 60} (2001) 229-239.
\bibitem{BMMSW} M. Ba\v{c}a, J. MacDougall, M. Miller, Slamin and W. Wallis, 
On certain valuations of graphs, preprint.  
\bibitem{BaM2} M. Ba\v{c}a and M. Miller, Valuations of a certain class of convex 
polytopes,  {\it J. Combin. Math. Combin. Comput.,} {\bf 43} 
(2002), 207--218.
\bibitem{BaM1} M. Ba\v{c}a and M. Miller, Antimagic face labeling of
convex polytopes based on biprisms,  {\it J. Combin. Math. Combin. 
Computing,} to appear.
\bibitem{BaM3} M. Ba\v{c}a and M. Miller,
On $d$-antimagic labelings of type $(1,1,1)$ for prisms, {\it J. Combin. 
Math. Combin. Comput.,} {\bf 44} (2003) 199-207. 
\bibitem{BMR} M. Ba\v{c}a, M. Miller and J. Ryan, On $d$-antimagic labelings 
of prisms and antiprisms, preprint. 
\bibitem{BMS} M. Ba\v{c}a, M. Miller and Slamin, Every generalized 
Petersen graph has a vertex-magic total labeling,
11th Australasian Workshop on Combinatorial Algorithms (Hunter Valley,
2000).{\em Int. J. Comput. Math.,} {\bf 79} (2002) 1259--1263.
\bibitem{Ba} R. 
Balakrishnan, Graph labelings, unpublished.
\bibitem{BK1} R. Balakrishnan and R. Kumar, Decomposition of complete 
graphs into isomorphic bipartite subgraphs, {\it Graphs and Combin.,} {\bf 
10} (1994) 19-25.
\bibitem{BK2} R. Balakrishnan and R. Kumar,
Existence and nonexistence of certain labellings for the graph $K_n^c \bigvee
2K_2$, {\it Utilitas Math.}, {\bf 46} (1994) 97-102.
\bibitem{BS} R. Balakrishnan and R. Sampathkumar,
Decompositions of regular graphs into
 $K_n^c \bigvee 2K_2$, {\it Discrete Math.}, {\bf 156} (1996) 19-28.
\bibitem{BSY1} R. Balakrishnan, A. Selvam and V. Yegnanarayanan,
On felicitous labelings of graphs, {\it Proceed. National Workshop on Graph
Theory and its Appl. Manonmaniam Sundaranar Univ., Tiruneli} (1996) 47-61.
\bibitem{BSY2} R. Balakrishnan, A. Selvam and V. Yegnanarayanan,
 Some results on elegant graphs,  {\it Indian J. Pure Appl. Math.},
{\bf 28} (1997) 905-916. 
\bibitem{BBS1} D. Bange, A. Barkauskas 
and P. Slater, Simply sequential and graceful graphs, 
 {\it {Proc. of the 10th S.E. Conf. on Combinat., Graph Theory, and 
Computing}}, (Utilitas Math. Winnipeg, 1979) 155-162.
\bibitem{BBS2} D. Bange, A. Barkauskas and P. Slater, Sequentially 
additive graphs, {\it Discrete Math.}, {\bf {44}} (1983) 235-241.
\bibitem{Bar1} C. Barrientos, New families of equitable graphs,
{\it Utilitas Math.,} {\bf 60} (2001) 123--137. 
\bibitem{Bar2} C. Barrientos, Graceful labelings of cyclic snakes,
{\it Ars Combin.,} {\bf 60} (2001) 85--96. 
\bibitem{Bar3} C. Barrientos, Equitable labelings of corona graphs,
{\it J. Combin. Math. Combin. Comput.,} {\bf 41} (2002) 139-149.
\bibitem{Bar4} C. Barrientos, Graceful labelings of chain and corona graphs,
{\it Bull. Inst. Combin. Appl.,} {\bf  34} (2002) 17-26. 
\bibitem{Bar5} C. Barrientos, Odd-graceful labelings, preprint. 
\bibitem{Bar6} C. Barrientos, The gracefulness of unions of  cycles 
and complete bipartite graphs, preprint. 
\bibitem{BDH} C. Barrientos, I. Dejter and H. Hevia, Equitable labelings 
of forests, {\it Combin. and Graph Theory}, {\bf 1} (1995) 
1-26.
\bibitem{BaH} C. Barrientos and H. Hevia, On $2$-equitable  labelings of 
graphs,
{\it Notas de la Sociedad de Matem\'{a}tica de Chile,} {\bf XV} (1996) 97-110.
\bibitem{BN} E. Baskoro and A. Ngurah, On super edge-magic total labelings,
{\it Bull. Inst. Combin. Appl.,}
  {\bf 37} (2003) 82--87. 
\bibitem{BGHJ} R. Beals, J. Gallian, P. Headley and D. Jungreis, 
Harmonious groups, {\it {J. Combin. Th., Series A}}, {\bf {56}} (1991) 
223-238.
\bibitem{Bea1} A. F. Beardon, Vertex-magic graphs, preprint.
\bibitem{Bea2} A. F. Beardon, Magic labellings of infinite graphs, 
preprint.
\bibitem{BeHe} L. W. Beineke and  S. M. Hegde,  Strongly multiplicative 
graphs, {\it  Discuss. Math. Graph Theory,} {\bf 21} (2001) 63-75. 
\bibitem{BL} M. Benson and S.M. Lee, On cordialness of regular windmill 
graphs, {\it {Congress. Numer.}}, {\bf {68}} (1989) 45-58.

\bibitem{Ber} C. Berge, Regularisable Graphs II,
             {\it Discrete Math.,}  {\bf  23} (1978)   91--95.
\bibitem{BHHJKW} D. Bergstrand, F. Harary, K. Hodges, G. Jennings, 
L. Kuklinski, and J. Wiener, 
The sum numbering of a complete graph, {\it Bull. Malaysian Math. Soc.,} 
{\bf 12} (1989) 25-28.
\bibitem{BHJ} D. Bergstrand, K. Hodges, G. Jennings, L. Kuklinski, J. Wiener 
and F. Harary, Product graphs are sum graphs, {\it Math. Magazine,}
{\bf 65} (1992) 262-264.
\bibitem{BPR} O. Berkman, M. Parnas and Y. Roditty, All cycles are 
edge-magic,
{\it Ars Combin.,} {\bf 59} (2001) 145-151.
\bibitem{Be} J.C. Bermond, Graceful graphs, radio antennae and French 
windmills, {\it Graph Theory and Combinatorics}, Pitman, London (1979) 18-37.
\bibitem{BBG} J.C. Bermond, A. E. Brouwer and A. Germa, Systemes de 
triplets
      et differences associ\`{e}es, {\it Problems Combinatories et 
Th\`{e}orie des
      Graphs}, Colloq. Intern. du Centre National de la Rech. Scient., 260,
      Editions du
      Centre Nationale de la Recherche Scientifique, Paris (1978) 35-38.
\bibitem{BF} J. C. Bermond and G. Farhi, Sur un probleme combinatoire
      d'antennes en radioastronomie II, {\it Annals of Discrete Math.,} 
{\bf 12} (1982) 49-53.
\bibitem{BKT} J. C. Bermond, A. Kotzig and J. Turgeon, On a 
combinatorial
problem of antennas in radioastronomy, in Combinatorics, A. Hajnal and V. T.
S\'{o}s, eds., {\it Colloq. Math. Soc. J\'{a}nos Bolyai}, {\bf 18}, 2
vols. North-Holland, Amsterdam (1978) 135-149. 
\bibitem{BeS} J.C. Bermond and D. Sotteau, Graph decompositions 
and $G$-design, {\it {Proc. 5th British Combin. Conf., 1975}}, {\it 
Congress. Numer.,}
 {\bf XV} (1976) 53-72.
\bibitem{BH} D. Beutner and H. Harborth, Graceful labelings of nearly complete 
graphs, {\it Result. Math.,} {\bf 41} (2002) 34-39. 
\bibitem{BA} V.  Bhat-Nayak and M. Acharya, private communication
\bibitem{BD1} V.  Bhat-Nayak and U. Deshmukh,
 Gracefulness of 
$C_{2x+1} \cup P_{x-2\theta}$, {\it Proc. International Conf. on Graph 
Theory and Number Theory, Trichy 1996,} to appear. 
\bibitem{BD2} V. 
Bhat-Nayak and U. Deshmukh, New 
families of graceful banana trees, {\it Proc. Indian Acad. Sci. Math. 
Sci.}, {\bf 106} (1996)  201-216.
\bibitem{BD3} V. Bhat-Nayak and U. Deshmukh, Gracefulness of $C_{4t} 
\cup K_{1,4t -1}$ and $C_{4t + 3} \cup K_{1,4t + 2}$, {\it J. Ramanujan 
Math. Soc.,}  {\bf 11} (1996) 187-190.  
\bibitem{BD4} V. Bhat-Nayak and U. Deshmukh, Skolem-graceful 
labelings of unions of paths, personal communication. 
\bibitem{BD5} V. Bhat-Nayak and U. Deshmukh, Gracefulness of $C_3 \cup 
P_n$, preprint.
\bibitem{BG} V. N. Bhat-Nayak and S. K. Gokhale, Validity of Hebbare's
conjecture, {\it Utilitas Math.}, {\bf 29} (1986) 49-59.
\bibitem{BNS} V. N. Bhat-Nayak and A. Selvam, Gracefulness of $n$-cone
$C_m \vee K_n^c$, {\it Ars Combin.,} {\bf 66} (2003) 283-298. 
\bibitem{BEV} A. Blinco, S. El-Zanati and C. Vanden Eynden, On the cyclic 
decomposition of complete graphs into almost-bipartite graphs, preprint.
\bibitem{Bl} G. S. Bloom, A chronology of the Ringel-Kotzig
 conjecture and the continuing quest to call all trees graceful,
 {\it 
Ann. N.Y. Acad. Sci.}, {\bf 326} (1979) 32-51.
\bibitem{BG1} G. S. Bloom and S. W. Golomb, Applications of numbered 
undirected graphs, {\it Proc. IEEE,} {\bf 65} (1977) 562-570.
\bibitem{BG2} G. S. Bloom and S. W. Golomb, Numbered complete graphs, 
unusual rulers, and assorted applications, in {\it  Theory and 
Applications of Graphs, Lecture Notes in Math.}, {\bf 642}, Springer-Verlag, New
York (1978) 53-65.
\bibitem{BH1} G. S. Bloom and D. F. Hsu, On graceful digraphs and a
problem in network addressing, {\it Congress. Numer.,} {\bf 35} 
(1982) 91-103.
\bibitem{BH2} G. S. Bloom and D. F. Hsu, On graceful directed graphs that 
are computational models of some algebraic systems, {\it Graph Theory with 
Applications to Algorithms and Computers}, Ed. Y. Alavi, Wiley,
 New York (1985).
\bibitem{BH3} G. S. Bloom and D. F. Hsu, On graceful directed graphs,
{\it SIAM J. Alg. Discrete Meth.,} {\bf 6} (1985) 519-536.
\bibitem{BW1} R. Bodendiek and G. Walther, Arithmetisch antimagische
Graphen,\\ Graphentheorie III, K. Wagner and R. Bodendiek (eds.), 
Mannhein, 1993.
\bibitem{BW2} 
 R. Bodendiek and G. Walther, On number theoretical methods in graph
labelings, {\it Res. Exp. Math.,} {\bf 21} (1995) 3-25.  
\bibitem{BW3} R. Bodendiek and G.  Walther,
$(A,D)$-antimagic parachutes,  
{\it Ars Combin.}, {\bf 42} (1996), 129--149. 
\bibitem{BW4} R. Bodendiek and G.  Walther,
$(a,d)$-antimagic parachutes II,  
{\it Ars Combin.}, {\bf 46} (1997), 33--63. 
\bibitem{BW5} R. Bodendiek and G.  Walther, On arithmetic 
antimagic edge
labelings of graphs, {\it Mitt. Math. Ges. Hamburg,} {\bf 
17} (1998) 85--99.
\bibitem{BSW1} R. Bodendiek, H. Schumacher and H. Wegner, 
\H{U}ber eine
spezielle Klasse grozi\H{o}ser Eulerscher Graphen, {\it Mitt.\ Math.\ 
Gesellsch.\ Hamburg}, {\bf 10} (1975) 241-248.
\bibitem{BSW2} R. Bodendiek, H. Schumacher and H. Wegner,
 \H{U}ber grazi\H{o}se
Graphen, {\it Math.-Phys. Semesterberichte,} {\bf 24} (1977) 103-106.
\bibitem{BLTD} J. Boland, R. Laskar, C. Turner and G. Domke, On mod sum 
 graphs, {\it Congress. Numer.,} {\bf 70} (1990) 131-135.
\bibitem{BoM} J. 
Bondy and U. Murty, {\it Graph Theory with Applications}, 
North-Holland, New York (1976).
\bibitem{BHH} I. Borosh, D. Hensley and A. Hobbs, 
   Vertex prime graphs and the Jacobsthal function.
   {\it Congress. Numer.,} {\bf 127} (1997) 193-222.
\bibitem{Bu1} C. Bu, Gracefulness of graph $K_n + {\overline K_m}$,
{\it J. Harbin Shipbuilding Eng. Inst.}, {\bf 15} (1994) 91-93. 
\bibitem{Bu2} C. Bu, Sequential labeling of the graph $C_n \odot 
{\overline K_m}$, preprint.
\bibitem{BuC1} C. Bu and C. Cao, The gracefulness for a class of 
disconnected graphs, {\it J. Natural Sci. Heilongjiang Univ.,} {\bf 12} 
(1995) 6-8.
\bibitem{BuC2} C. Bu and L. Chen, Some conclusions about graceful graphs,
 {\it J. Harbin Shipbuilding Eng. Inst.}, {\bf 14} (1993)  103-108.
\bibitem{BuF} C. Bu and W. Feng, Some composite theory about graceful graphs,
 {\it J. Harbin Eng. Univ.}, {\bf 16} (1995)  94-97.
\bibitem{BGZ} C. Bu, Z. Gao and D. Zhang,
On $k$-gracefulness of $r-p_n \times p_2$, {\it J. 
Harbin Shipbuilding Eng. Inst.}, {\bf 15} (1994)  85-89.
\bibitem{BuH} C. Bu and B. He, The $k$-gracefulness of some graphs, 
 {\it J. Harbin Eng. Univ.}, {\bf 14} (1993)  92-95.
\bibitem{BuS1} C. Bu and J. Shi, A class of $(k,d)$-arithmetic graphs, 
   {\it J. Harbin  Eng. Univ.}, {\bf 16} (1995) 79-81.
\bibitem{BuS2} C. Bu and J. Shi, Some conclusions about indexable 
graphs,   {\it J. Harbin  Eng. Univ.}, {\bf 16} (1995) 92-94.
\bibitem{BZ} C. Bu and J. Zhang, The properties of $(k,d)$-graceful graphs, 
Elsevier preprint.
\bibitem{BZH} C. Bu, D. Zhang and B. He, $k$-gracefulness of $C_n^m,$
 {\it J. Harbin 
Shipbuilding Eng. Inst.}, {\bf 15} (1994) 95--99.
\bibitem{BurF}
M. Burzio and G.  Ferrarese, 
The subdivision graph of a graceful tree is a graceful tree, 
{\it Discrete Math.}, {\bf 181} (1998),  275--281.
\bibitem{BoS} C. P. Bonnington and J. \v{S}ir\'{a}\v{n}, Bipartite 
labelings of trees with maximum degree three, {\it J. Graph Theory,} {\bf
31}
(1999) 79-91.
\bibitem{CLM} S. Cabaniss, R.  Low,  and J.  Mitchem, 
On edge-graceful regular graphs and trees, 
{\it Ars Combin.}, {\bf 34} (1992) 129--142.
\bibitem{CJ} L. Caccetta and R.  Jia,
   Positive binary labelings of graphs,
   {\it Austral. J. Comb.}, {\bf 14} (1996)  133--148. 
\bibitem{C1} I. Cahit, Elegant valuation of the paths, {\it {Ars 
Combin.}}, {\bf {16}} (1983) 223-227.
\bibitem{C2} I. Cahit, Cordial graphs: a weaker version of graceful and
harmonious graphs, {\it Ars Combin.,} {\bf 23} (1987) 201-207.
\bibitem{C3} I. Cahit, On cordial and 3-equitable labellings of graphs, 
{\it {Utilitas Math.}}, {\bf {37}} (1990) 189-198.
\bibitem{C4} I. Cahit, Status of graceful tree conjecture in 1989, in 
{\it Topics in Combinatorics and Graph Theory}, 
R. Bodendiek and R. Henn (eds), {\it Physica-Verlag}, Heidelberg 1990.
\bibitem{C5} I. Cahit, Recent results and open problems on cordial 
graphs, {\it Contemporary Methods in Graph Theory}, R. Bodendiek (ed.), 
Wissenschaftsverlag, Mannheim, 1990, 209-230.
\bibitem{C6} I. Cahit, Equitable tree labellings, {\it Ars Combin.,} {\bf 
40} (1995) 279-286.
\bibitem{C7} I. Cahit, On harmonious tree labellings, {\it Ars Combin.,} 
{\bf 41} (1995) 311-317.
\bibitem{C8} I. Cahit, $H$-cordial graphs, {\it Bull. Inst. 
Combin. Appl.}, {\bf 18} (1996) 87-101.
\bibitem{C9} I. Cahit, Graceful labelings of rooted complete trees, preprint.
\bibitem{C10} I. Cahit, A note on graceful directed trees, preprint. 
\bibitem{CY} I. Cahit and R. Yilmaz, $E_3$-cordial graphs, {\it Ars
Combin.,} {\bf 54} (2000) 119-127.
\bibitem{CE} N. Cairnie and K. Edwards, The computational complexity of
cordial and equitable labelling, {\it Discrete Math.,} {\bf 216} (2000)
29-34.
\bibitem{Ca} K. Carlson, Generalized books and $C_m$-snakes are prime graphs,
preprint.
\bibitem{CRS} Y. Caro, Y. Roditty and J. Sch\H{o}nheim, Starters for 
symmetric $(n, G, 1)$-designs. $\rho$-labelings revisited, preprint.
\bibitem{Cha} G. J. Chang, Strong sum graphs, 
{\it Bull. Inst. Combin. Appl.,}
 {\bf 7} 
(1993) 47-52.
\bibitem{CHR} G. J. Chang, D. F. Hsu and D. G. Rogers, Additive variations 
on a graceful theme: some results on harmonious and other related graphs,
{\it Congress. Numer.,} {\bf 32} (1981) 181-197.
\bibitem{CEZH} G.  Chartrand, D. Erwin, P.  Zhang and F.  Harary,
Radio labelings of graphs, {\it Bull. Inst. Combin. Appl.,} {\bf 33} 
(2001) 77--85.
\bibitem{CLZ}  G. Chartrand, S. M. Lee and P. Zhang, Randomly 
cordial graphs, preprint.
\bibitem{CL}  G. Chartrand and L. Lesniak, {\it 
Graphs \& Digraphs} 3rd ed. CRC Press (1996).
\bibitem{ChJ}  
D. L. Chen and C. J.  Jiang, 
The $K$-gracefulness of the rhomb-ladder graph $\nabla\sp m\sb 
n$, {\it Shandong Kuangye Xueyuan Xuebao}, {\bf 11} (1992) 196--199, 
208.
\bibitem{CLY} 
W.C. Chen, H.I. L\"{u} and Y.N. Yeh, Operations of interlaced trees and 
graceful trees, {\it Southeast Asian Bull. Math.}, {\bf 21} (1997) 337--348.
\bibitem{Che1} Z. Chen,  Harary's conjectures on integral sum graphs 
 {\it Discrete Math.}, {\bf 160} (1996) 241-244.
\bibitem{Che2} Z. Chen, Integral sum graphs from identification, {\it 
Discrete Math.}, {\bf 181} (1998) 77-90.
\bibitem{Che3} Z. Chen,  On super edge-magic graphs. {\it J. Combin. 
Math. Combin. Comput.,} {\bf 38} (2001), 55--64.
\bibitem{Che4} Z. Chen, On integral sum graphs,  {\it 
Discrete Math.}, to appear.
\bibitem{CheZ} Z.-Z. Chen, A 
generalization of the Bodendiek 
conjecture about graceful graphs,  {\it Topics in Combinatorics 
and Graph Theory}, R. Bodendiek and R. Henn, eds.,  Physica-Verlag, 
Heidelberg, 1990, 737-746.
\bibitem{CK1} S. A.  Choudum and S. P. M. Kishore, All 5-stars are 
Skolem graceful, {\it Indian J. Pure and Appl. Math.}, 
{\bf 27} (1996) 1101-1105.
\bibitem{CK2} S. A.  Choudum and S. P. M. Kishore, Graceful labellings 
of the union of paths and cycles, {\it Discrete Math.,} {\bf 206} (1999)
105-117.
\bibitem{CK3} S. A.  Choudum and S. P. M. Kishore, On Skolem 
gracefulness of $k$-stars, {\it Ramanujan Mathematical Society Inter.
Conf. on 
Discrete Math. and Number Theory}, 1996, to appear.
\bibitem{CK4} S. A.  Choudum and S. P. M. Kishore, Graceful labelling 
of the union of cycles and stars, preprint.
\bibitem{CH} F. R. K. Chung and F. K. Hwang, Rotatable graceful graphs,
{\it Ars Combin.,} {\bf 11} (1981) 239-250.
\bibitem{CT} D. Craft and E. H. Tesar, On a question by
Erd\H{o}s about edge-magic graphs, {\it Discrete Math.}, {\bf 207} (1999)
271-276.
\bibitem{DL1} P. Deb and N. B. Limaye, On elegant labelings of triangular
snakes, {\it J. Combin. Inform. System Sci.,} {\bf 25} (2000) 163--172. 
\bibitem{DL3} P. Deb and N. B. Limaye, Some families of elegant and
harmonius graphs, {\it Ars Combin.,} {\bf 61} (2001) 271-286. 
\bibitem{DL2} P. Deb and N. B. Limaye, On harmonius labelings of some
cycle related graphs, 
{\it  Ars Combin.,} {\bf 65} (2002) 177--197.
\bibitem{D} C. Delorme, Two sets of graceful graphs, {\it J. Graph Theory},
{\bf 4} (1980) 247-250.
\bibitem{DMTKT} C. Delorme, M. Maheo, H. Thuillier, K. M. Koh and H. K. Teo,
Cycles with a chord are graceful, {\it J. Graph Theory}, {\bf 4} (1980) 
409-415.
\bibitem{De} Y. X.  
Deng, 
Harmoniousness of the graphs $C\sb n+\overline K\sb t$, 
{\it J. Math. Res. Exposition}, {\bf 15} (1995), suppl., 79--81.
\bibitem{DLL} G. Denham, M.G. Leu and A. Liu, All 4-stars are 
Skolem-graceful, {\it Ars Combin.,} {\bf 36} (1993) 183-191.
\bibitem{DLM} T. Deretsky, S.M. Lee and J. Mitchem, On vertex prime 
labelings of graphs, in
 {\it Graph Theory, Combinatorics and Applications Vol. 1}, 
 J.Alavi, G. Chartrand, O. Oellerman and A. 
Schwenk, eds., Proceedings 6th International Conference Theory and 
Applications of Graphs (Wiley, New York, 1991) 359-369. 
\bibitem{DH}    U.Derings and  H.H\"unten, Magic graphs - A new 
characterization, Report No. 83265 - OR, Universit\"at Bonn
April 1983, ISSN 0724-3138.
\bibitem{Dev} J. Devraj, On consecutive labelings of ladder graphs, preprint.
\bibitem{Dom} J. Doma, Unicyclic Graceful Graphs, M. S. Thesis, McMaster 
Univ., 1991.
\bibitem{DEES} D. Donovan, S. El-Zanati, C. Vanden Eynden, S. 
Sutinuntopas, Labelings of 
unions of up to four uniform cycles, preprint. 
\bibitem{Doo1} M. Doob,   On the construction of magic graphs,
 {\it Congress Numer.,} {\bf 10}  (1974) 361--374.
\bibitem{Doo2} M. Doob,  
 Generalizations of magic graphs,
 {\it J. Combin. Theory, Ser. B}  {\bf 17} (1974) 205-217.
\bibitem{Doo3} M. Doob, Characterizations of regular magic graphs, {\it
 J. Combin. Theory, Ser. B}, {\bf 25} (1978) 94--104.
\bibitem{Dr} A. Draganova, personal communication.
\bibitem{Du} G. M. Du, 
Cordiality of complete $k$-partite graphs and some special graphs, 
{\it Neimenggu Shida Xuebao Ziran Kexue Hanwen Ban}, (1997)  9--12.
\bibitem{DQ} G. Duan and Y.  Qi,  $k$-gracefulness of two classes of 
graphs, (Chinese)  {\it J. Zhengzhou Univ. Nat. Sci. Ed.,}  34  (2002)
 36--38, 49.
\bibitem{Duf} M. Dufour, Sur la Decomposition d'un Graphe Complet en Arbres 
Isomorphes, Ph. D. Thesis, Universite de  Montreal, 1995.
\bibitem{E} P. Eldergill, Decomposition of the Complete Graph with an Even 
Number of Vertices, M. Sc. Thesis, McMaster University, 1997.
\bibitem{El} M. N. 
Ellingham, Sum graphs from trees, {\it {Ars Combin.}}, {\bf 35} (1993) 335--349.
\bibitem{EFS} S. El-Zanati, H.-L. Fu and C.-L. Shiue, A 
note on the
$\alpha$-labeling number of  bipartite graphs, {\it Discrete Math.,} {\bf
214}
(2000) 241-243.
\bibitem{EV1} S. El-Zanati and C. 
Vanden Eynden, Decompositions of $K_{m,n}$ into cubes, {\it J. Combin.
Designs,} {\bf 4} (1996) 51-57.
\bibitem{EV2} S. El-Zanati and C. Vanden Eynden, On graphs with strong
$\alpha$-valuations, {\it Ars Combin.}, {\bf 56} (2000) 175--188.
\bibitem{EV3} S. El-Zanati and C. Vanden Eynden, On $\alpha$-valuations of
disconnected graphs,  {\it Ars Combin.}, {\bf 61} (2001) 
129-136.
\bibitem{EKV} S. El-Zanati, M. Kenig and C. Vanden Eynden, Near $\alpha$-labelings 
of bipartite graphs,  {\it Australasian J. Comb.,} {\bf 21} (2000) 275-285.
\bibitem{EVP} S. El-Zanati,  C. Vanden Eynden and N. Punnim, On the 
cyclic decomposition of complete graphs into bipartite graphs, 
  {\it Australasian J. Comb.,} {\bf 24} (2001) 209-219.
\bibitem{ELNR} H. Enomoto, A. S.   Llado, T.  
Nakamigawa, G. Ringel, Super edge-magic graphs, {\it SUT J. Math.,} {\bf 34} 
(1998) 105--109. 
\bibitem{EMN} H. Enomoto, K. Masuda and  
Nakamigawa, Induced graph theorem on magic valuations, 
{\it Ars Combin.,} {\bf 56} (2000) 25-32.
\bibitem{EE} P. Erd\H{o}s and A. B. Evans, Representations of graphs and
orthogonal Latin squares, {\it J. Graph Theory,} {\bf 13}   (1989) 593-595.
\bibitem{Es1} K.  Eshghi, The Existence and Construction of 
$\alpha$-valuations 
of 2-Regular Graphs with 3 Components, Ph. D. Thesis, Industrial Engineering 
Dept., University of  Toronto, 1997.
\bibitem{Es2} K.  Eshghi, $\alpha$-valuations of special classes of 
quadratic graphs, {\it Bull. Iranian Math. Soc.,} {\bf 28} 2002 29--42. 
\bibitem{EFMMP} A. B. Evans, G. H. Fricke, C. C. Maneri, T. A. McKee and M. 
Perkel, Representations of graphs modulo $n$, {\it J. Graph Theory} {\bf 
18} 
(1994) 801--815.
\bibitem{EIN} A. B. Evans, G. Isaak and D. A. Narayan, Representations of
graphs modulo $n$, {\it Discrete Math.,} {\bf 223} (2000) 109-123.
\bibitem{ELMPW} G. Exoo, A. Ling, J. McSorley, N. Phillips and W. Wallis, 
Totally magic graphs, {\it Discrete Math.,} {\bf 254} (2002) 103-113.
\bibitem{FI} R. Figueroa-Centeno and R. Ichishima, The $n$-dimensional cube 
is felicitous,
 {\it Bull. Instit. Combin. Appl.,} to appear.
\bibitem{FIM3} R. Figueroa-Centeno, R. Ichishima and F.
Muntaner-Batle, Bertrand's postulate and magic product labelings,
{\it Bull.  Instit.  Combin. 
Appl.,} {\bf 30} (2000), 53-65.
\bibitem{FIM1} R. Figueroa-Centeno, R. Ichishima and F. 
Muntaner-Batle,
The place of super edgemagic labelings among other classes of labelings,
{\it Discrete Math.,} {\bf 231} (2001), 153-168.
\bibitem{FIM2} R. Figueroa-Centeno, R. Ichishima and F. Muntaner,
On super edge-magic graphs, {\it Ars Combin.,} {\bf 64} (2002) 81-95. 
\bibitem{FIM7} R. Figueroa-Centeno, R. Ichishima and F. 
Muntaner-Batle, Magical coronations of graphs,
{\it Australasian J. Combin.,} {\bf 26} (2002) 199-208.
\bibitem{FIM6} R. Figueroa-Centeno, R. Ichishima and F.
Muntaner-Batle, Labeling the vertex amalgamation of graphs,
{\it Discuss. Math. Graph Theory}, {\bf  23} (2003) 129--139.
\bibitem{FIM4} R. Figueroa-Centeno, R. Ichishima and F.
Muntaner-Batle, On the super edge-magic deficiency of graphs, preprint. 
\bibitem{FIM5} R. M. Figueroa-Centeno, R. Ichishima and F.
Muntaner-Batle, On  edge-magic labelings of certain disjoint unions of graphs, 
preprint. 
\bibitem{FIM8} R. Figueroa-Centeno, R. Ichishima and F.
Muntaner-Batle, A magical approach to some labeling conjectures,
preprint.  
\bibitem{FIM9} R. Figueroa-Centeno, R. Ichishima and F. 
Muntaner-Batle, Some new results on the super edge-magic deficiency of 
graphs, preprint. 
\bibitem{Fr1} D. Fron\v{c}ek, personal communication.
\bibitem{Fr2} D. Fron\v{c}ek, personal communication.
\bibitem{FKK1}  D.~Fron\v{c}ek, P.~Kov\'{a}\v{r} and 
T.~Kov\'{a}\v{r}ov\'{a}, preprint.
\bibitem{FK} D. Fron\v{c}ek and M. Kubesa, personal communication.
\bibitem{F1} R. Frucht, Graceful numbering of wheels 
and related graphs, {\it Ann. N.Y. Acad. Sci.}, {\bf 319} (1979) 219-229.
\bibitem{F2} R. Frucht, On mutually graceful and pseudograceful 
labelings of trees, {\it Scientia Series A,} {\bf 4}
(1990/1991) 31-43.
\bibitem{F3} R. Frucht, Nearly graceful labelings of graphs, {\it Scientia},
{\bf 5} (1992-1993) 47-59.
\bibitem{FG} R. Frucht and J. A. Gallian, Labeling prisms,
{\it Ars Combin.}, {\bf 26} (1988) 69-82.
\bibitem{FS} R. Frucht and L. C. Salinas, Graceful numbering of snakes
with constraints on the first label, {\it Ars Combin.}, {\bf 20} (1985),
B, 
143-157.
\bibitem{FH} H. L. Fu and K. C. Huang, On prime labelling, {\it Discrete 
Math.,} {\bf 127} (1994) 181-186.
\bibitem{FW} H. L. Fu and S. L. Wu, New results on graceful graphs, 
{\it J. Combin. Info. Sys. Sci.}, {\bf 15} (1990) 170-177.
\bibitem{Fuk1} Y. Fukuchi, A recursive theorem for super edge-magic 
labelings of trees, {\it SUT J. Math.,} {\bf 36} (2000) 279-285.
\bibitem{Fuk2} Y. Fukuchi, Edge-magic labelings of generalized Petersen 
graphs 
$P(n,2)$ {\it Ars Combin.,} {\bf 59} (2001) 253-257.
\bibitem{Fuk3} Y.  Fukuchi,  Edge-magic labelings of wheel graphs, {\it 
Tokyo 
J. Math.,} {\bf 24} (2001) 153--167.
\bibitem{Ga1} J. A. Gallian, Labeling prisms and prism related graphs,
{\it Congress. Numer.}, {\bf 59} (1989) 89-100.
\bibitem{Ga2} J. A. Gallian, A survey: recent results, conjectures and 
open problems on labeling graphs, {\it {J. Graph Theory}}, {\bf{13}} 
(1989) 491-504.
\bibitem{Ga3} J. A. Gallian, Open problems in grid labeling, {\it {Amer. 
Math. Monthly}}, {\bf {97}} (1990) 133-135.
\bibitem{Ga4} J. A. Gallian, A guide to the graph labeling zoo, {\it
Discrete Appl. Math.,} {\bf 49} (1994) 213-229. 
\bibitem{GJ} J. A. Gallian and D. S. Jungreis, Labeling books, 
 {\it Scientia}, {\bf 1} (1988) 53-57.
\bibitem{GPW} J. A. Gallian, J. Prout and S. Winters, Graceful and
harmonious labelings of prisms and related graphs, {\it Ars Combin.},
{\bf 34} (1992) 213-222.
\bibitem{GH} T. Gangopadhyay and S.P. Rao Hebbare, Bigraceful graphs-I, 
{\it { Utilitas Math.}}, {\bf 17} (1980) 271-275.
\bibitem{Gao} Y. Z. Gao, On gracefulness of $C_m \cup P_2$, {\it J. Hebei 
Teachers College}, No. 3 (1993) 13--21.
\bibitem{GaL} Y. Z. Gao and Z. H. 
Liang, private communication.
\bibitem{Gar} M. Gardner, Mathematical games: the graceful graphs of 
Solomon Golomb, or how to number a graph parsimoniously, {\it Scientific 
American,} {\bf 226} 3 (1972) 108-112; {\bf 226} 4 (1972) 104; {\bf
226} 6 (1972) 118.
\bibitem{GK} M.   Ghebleh and R. Khoeilar, A note on: ``$H$-cordial graphs" 
{\it Bull. Inst. Combin. Appl.,} {\bf 31} (2001) 60--68.
\bibitem{GLPF} J. Ghoshal, R. Laskar, D. Pillone and G. Fricke, Further
results on mod sum graphs, {\it Cong. Numer.,} {\bf 101} (1994) 201--207.
\bibitem{Gn} R.B. Gnanajothi, Topics in Graph Theory, Ph.D. Thesis, 
Madurai Kamaraj University, 1991. 
\bibitem{GoS} R. Godbold and P.J. Slater, All cycles are edge-magic, {\it 
Bull. Inst. Comb. Appl.,} {\bf 22} (1998) 93--97.
\bibitem{GoL} C. G. Goh and C. K.  Lim, Graceful numberings of cycles with 
consecutive chords, 1992, unpublished.
\bibitem{Go} S. W. Golomb, 
How to number a graph, in {\it Graph Theory and
Computing}, R. C. Read, ed., Academic Press, New York (1972) 23-37.
\bibitem{GBGGGJ} J. Goodell, A. Beveridge, M. Gallagher, D. Goodwin, 
J. Gyori, A. Joseph, Sum graphs, unpublished.
\bibitem{GR} R.J. Gould and V. R\"{o}dl, Bounds on the 
number of isolated vertices in sum graphs, {\it {Graph Theory, 
Combin. and Appl.}}, {\bf {1}} (1991) 553-562.
\bibitem{Gr1} T. Grace, 
Graceful, Harmonious, and
 Sequential
Graphs,  Ph.D. Thesis, University Illinois at Chicago Circle, 1982.
\bibitem{Gr2} T. Grace, On sequential labelings of graphs, {\it J. Graph
Theory}, {\bf 7} (1983) 195-201.
\bibitem{Gr3} T. Grace, $K_4$ snakes are sequential,  Technical Report, 
Department
 of Computer Science, Illinois Institute of Technology (1986).
\bibitem{GS} R. L. Graham and N. J. A. Sloane, On additive bases and
harmonious graphs, {\it SIAM J. Alg. Discrete Meth.,} {\bf 1} (1980) 
382-404.
\bibitem{GGH} M. Grannell, T. Griggs, F. Holroyd, Modular gracious 
labelings of trees,
{\it Discrete Math.,} {\bf 231} (2001) 199--219.
\bibitem{Gr} R.P. Grimaldi, Graphs from rings, {\it {Congress. 
Numer.}}, {\bf {71}} (1990) 95-104.
\bibitem{Gu1} W. F. Guo, Gracefulness of the graph $B(m,n)$,
{\it J. Inner Mongolia Normal Univ.,} (1994) 24--29.
\bibitem{Gu2} W. F. Guo, Gracefulness of the graph $B(m,n,p)$,
 {\it J. Math. (PRC)}, {\bf 15} (1995) 345--351.
\bibitem{GyL} A. Gy\'{a}rf\'{a}s and J. Lehel, A method to generate 
graceful trees, in {\it Colloque C.N.R.S. Probl\`{e}mes Combinator\-ies et 
Th\'{e}orie des Graphes, Or\-say, 1976} (1978) 207-209.
\bibitem{Hao} T. Hao, On sum graphs,  {\it J. Combin. Math. Combin. 
Computing,} 
 {\bf 6} (1989) 207-212. 
\bibitem{Ha1} F. Harary, Sum graphs and difference graphs, {\it 
{Congress. Numer.}}, {\bf {72}} (1990) 101-108.
\bibitem{Ha2} F. Harary, Sum graphs over all the integers, {\it Discrete 
Math.,} {\bf 124} (1994) 99-105. 
\bibitem{HHJ} F. Harary, I. Hentzel and D. Jacobs, Digitizing sum graphs over
the reals, {\it Caribb. J. Math. Comput. Sci.,} {\bf 1} (1991) 1-4.
\bibitem{HaHs} F. Harary and D. Hsu, Node-graceful graphs, {\it{Comput. 
Math. Appl.}}, {\bf {15}} (1988) 291-298.
\bibitem{Har} M. Harminc, 
   On a characterization of graphs by average labelings,
   {\it Discuss. Math., Graph Theory,} {\bf 17} (1997) 133--136.
\bibitem{HaSo} M. Harminc and R.  Sot\'{a}k,  Graphs with average
labellings, Graph theory (Prague, 1998) {\it  Discrete Math.,} {\bf 233} (2001)
 127--132. 
\bibitem{HR} N. Hartsfield and G. Ringel, 
{\it Pearls in Graph Theory}, Academic Press, San Diego, 1990.
\bibitem{HaSm} N. Hartsfield and W.F. Smyth, The sum number of complete 
bipartite graphs, in {\it Graphs and Matrices} (ed. R. Rees), Marcel Dekker (1992) 
205-211.
\bibitem{He} M. He,
The gracefulness of the graph $2C_n$, {\it Neimenggu Daxue Xuebao Ziran 
Kexue}, {\bf 26} (1995) 247-251.
\bibitem{HYMXSW} W. He, X. Yu, H. Mi, Y. Sheng and L. Wang, The
(integral) sum number of the graph $K_n - E(K_r)$ for $K_r \subset K_n$,
{\it Discrete Math.,} {\bf 243} (2002) 241-252.
\bibitem{HSWCKY} Y. He, L.  Shen, Y.  Wang, Y. Chang, Q. Kang and  X.  Yu, 
The integral sum number of complete bipartite graphs $K\sb {r,s}$, {\it Discrete 
Math.,} {\bf 239} (2001) 137--146.
%\bibitem{HSWCKY} W.  He, Y. Shen,  L.  Wang, Y.  Chang, Q. Kang and X.  Yu, 
%The integral sum number of complete bipartite graphs $K_{r,s}$, {\it 
%Discrete 
%Math.,} {\bf 239} (2001) 137--146.
\bibitem{H} S. P. Rao Hebbare, Graceful cycles, 
{\it Utilitas Math.}, {\bf 10} (1976) 307-317.
\bibitem{HeH} K. Heinrich and P. Hell, On 
the problems of bandsize, {\it Graphs and Combin.}, {\bf 3} (1987) 279-284.
\bibitem{Heg1} S. M. Hegde, Additively graceful graphs, {\it Nat. Acad. 
Sci. Lett.}, {\bf 12} (1989) 387-390.
\bibitem{Heg2} S. M. Hegde, On indexable graphs, {\it J. Combin. Inf. Sci. 
Sys.,}  {\bf 17} (1992) 316--331.
\bibitem{Heg3} S. M. Hegde, On $K$-sequential graphs, 
 {\it Nat. Acad. Sci. Lett.}, {\bf 16} (1993) 299-301. 
\bibitem{Heg4} S. M. Hegde, On $(k,d)$-graceful graphs, 
{\it J. Combin., Inform. \& Sys. Sci.,} {\bf 25} (2000) 255-265.
\bibitem{Heg5} S. M. Hegde, On sequentially additive graphs,
preprint.
\bibitem{Heg6} S. M. Hegde, Further results on set sequential and 
set graceful graphs,
preprint.
\bibitem{HeSh1} S. M. Hegde and S. Shetty, Sequential and magic labeling 
of a class of trees,  {\it Nat. Acad. Sci. Letters,} {\bf 24} (2001)
137-141. 
\bibitem{HeSh2} S. M. Hegde and S. Shetty, On graceful trees, {\it Appl. 
Math. 
E-Notes,} {\bf 2} (2002) 192-197.
\bibitem{HeSh3} S. M. Hegde and S. Shetty, On arithmetic graphs, {\it 
Indian J. Pure Appl. Math.,} {\bf 33} (2002) 1275-1283.
\bibitem{HeSh4} S. M. Hegde and S. Shetty, On magic graphs, {\it 
Australasian 
J. Combin.,} {\bf 27} (2003) 277-284.
\bibitem{HeSh5} S. M. Hegde and S. Shetty, Strongly $k$-indexable and 
super edge magic labelings are equivalent, preprint.
\bibitem{HL} Y.S. Ho and S.M. Lee, Some initial results on the supermagicness 
of regular complete $k$-partite  graphs, 
 {\it J. Combin. Math. Combin. Computing,}  
{\bf 39} (2001) 
3-17. 
\bibitem{HLSe} Y.S. Ho, S.M. Lee and E. Seah, on the edge-graceful 
$(n,kn)$-multigraphs conjecture,
 {\it J. Combin. Math. Combin. Computing} 
(1991) 141-147.
\bibitem{HLS1} Y.S. Ho, S.M. Lee and S.C. Shee, Cordial labellings of 
unicyclic graphs and generalized Petersen graphs, 
 {\it {Congress. Numer.}}, {\bf {68}} (1989) 109-122.
\bibitem{HLS2} Y.S. Ho, S.M. Lee and S.C. Shee, Cordial labellings of 
the cartesian product and composition of graphs, 
 {\it {Ars Combin.}}, {\bf {29}} (1990) 169-180.
\bibitem{HK} C. Hoede and H. Kuiper, All wheels are graceful, {\it Utilitas
Math.}, {\bf 14} (1987) 311.
\bibitem{Ho} M. Hovey, $A$-cordial graphs, {\it {Discrete Math.}}, {\bf 
{93}} (1991) 183-194.
\bibitem{HrHa} P. Hrn\v{c}iar and A. Haviar, All trees of diameter five 
are 
graceful, {\it Discrete Math.,} {\bf 233} (2001) 133-150.
\bibitem{Hs} D. F. Hsu, Harmonious labelings of windmill graphs and related
graphs, {\it J. Graph Theory}, {\bf 6} (1982) 85-87.
\bibitem{HK1} D.F. Hsu and A.D. Keedwell, Generalized complete 
mappings, neofields, sequenceable groups and block designs, I, 
 {\it { Pacific J. Math.}}, {\bf {111}} (1984) 317-332.
\bibitem{HK2} D.F. Hsu and A.D. Keedwell, Generalized complete 
mappings, neofields, sequenceable groups and block designs, II, 
 {\it {Pacific J. Math.,}} {\bf {117}} (1985) 291-312.
\bibitem{Hua} Q. Huang, Harmonious labeling of crowns $C_n \odot K_1$, 
preprint.
\bibitem{HKR} C. Huang, A. Kotzig and A. Rosa, Further results on tree 
labellings, {\it Utilitas Math.}, {\bf 21c} (1982) 31-48.
\bibitem{HuS} J. Huang and S. Skiena, Gracefully labeling prisms, 
{\it Ars Combin.,} {\bf 38} (1994) 225-242.
\bibitem{Iv} J. Ivan\u{c}o, On supermagic regular graphs, {\it Math. 
Bohemica,} 
{\bf 125} (2000) 99-114.
\bibitem{IL} J. Ivan\v co and I. Lu\v ckani\v cov\'{a},
On edge-magic disconnected graphs,
{\em SUT J. Math.,} {\bf 38} (2002)175--184.
\bibitem{Je} R. H.  Jeurissen, Magic graphs, a characterization, {\it 
Europ. J. Combinatorics}, {\bf 9} (1988) 363-368.
\bibitem{JT} S. Jezn\'{y} and M. Trenkl\'er, Characterization of magic
graphs, {\it Czechoslovak Math. J.}, {\bf 33} (1983) 435-438.
\bibitem{JLLLLZ} 
D. J. Jin, S. Z.  Liu, S. H.  Lee, H. L.  Liu, 
X. G. Lu and 
D. Zhang, 
The joint sum of graceful trees,
{\it Comput. Math. Appl.}, {\bf 26} (1993) 83-87.
\bibitem{JMW}  D. J. 
Jin, F. 
H.  Meng and J. G.  Wang, The gracefulness of trees with diameter $4$, 
{\it Acta Sci. Natur. Univ. Jilin.}, (1993) 17--22.
\bibitem{JS} M. I. Jinnah and G. S. Singh, A note on arthmetic 
numberings of graphs, {\it Proc. Symposium on Graphs and 
Combinatorics, Kochi, Kerala, India} (1991) 83-87.
\bibitem{J} R. P. Jones, Gracelessness,  Proc.\ 10th S-E Conf.\ 
Combinatorics, Graph Theory, and Computing, Congress. Numer., {\bf 
XXIII-XXIV}, {\it Utilitas Math.,} (1979) 547-552.
\bibitem{JR} D. Jungreis and M. Reid, Labeling grids, {\it{Ars Combin.,}} 
{\bf 34} (1992) 167-182.
\bibitem{Ka} Q.D. Kang, The $k$-gracefulness of the product graphs $P_m 
\times C_{4n}$, {\it {J. Math. Res. Exposition}}, {\bf {9}} (1989) 623-627.
\bibitem{KLGY} Q. D. Kang, Z.-H. Liang, Y.-Z. Gao and G.-H. Yang, On the 
labeling of some graphs, {\it J. Combin. Math. Combin. Comput.}, {\bf 22} 
(1996) 193-210. 
\bibitem{KZ} Q. D. Kang and X. Zhao, Strongly harmonious labelings of 
windmill graphs,  {\it J. Hebei Normal College}, {\bf 2} (1992) 1-7.
\bibitem{Kat1} K. Kathiresan, Subdivisions of ladders are graceful, {\it 
Indian J. Pure Appl. Math.,} {\bf 23} (1992) 21-23.
\bibitem{Kat4} K. Kathiresan, Two classes of graceful graphs, {\it Ars
Combin.,} {\bf 55} (2000) 129-132.
\bibitem{Kat2} K. Kathiresan, Graceful labeling of ladders with pendant 
edges, preprint.
\bibitem{Kat3} K. Kathiresan, Odd graceful graphs, preprint.
\bibitem{KaMN} K. Kathiresan, S. Muthuvel and V. Nagasubbu, Consecutive 
labelings for two classes of plane graphs, {\it Utilitas Math.,} {\bf 55} (1999) 
237-241.
\bibitem{KS} J. Keene and A. Simoson, Balanced strands for asymmetric, 
edge-graceful spiders, {\it Ars Combin.}, {\bf 42} (1996) 49-64.
\bibitem{Ki1} W.W. Kirchherr, On the cordiality of some specific graphs, 
{\it {Ars Combin.,}} {\bf 31} (1991) 127-138.
\bibitem{Ki2} W.W. Kirchherr, NEPS operations on cordial graphs, 
{\it{Discrete Math., }} {\bf 115} (1993)
 201-209.
\bibitem{Kis} S. P. Kishore, Graceful Labellings of Certain Disconnected 
Graphs, Ph. D. Thesis, Indian Institute of Technology, Madras, 1996.
\bibitem{KP} K. M. Koh and N. Punnim, On graceful graphs: cycles with 
3-consecutive chords,  {\it Bull. Malaysian Math. Soc.,}  {\bf 5} (1982) 
49-63.
\bibitem{KRLT} K. M. Koh, D. G. Rogers, P. Y. Lee and C. W. Toh, On
graceful graphs V: unions of graphs with one vertex in common, {\it Nanta Math.,} {\bf 12} (1979) 133-136. 
\bibitem{KRL} K. M. Koh,
 D. G. Rogers and C. K. Lim,  On graceful 
graphs: sum of graphs, Research Report 78, College of Graduate Studies, 
Nanyang University (1979).
\bibitem{KRT1} K. M. Koh, D. G. Rogers and T. Tan, On graceful 
trees, {\it Nanta Math.}, {\bf 10} (1977) 27-31.
\bibitem{KRT2} K. M. Koh, D. G. Rogers and T. Tan, A graceful arboretum:
a survey of graceful trees, in {\it
 Proceedings of Franco-Southeast
Asian
Conference}, Singapore, May 1979, {\bf  2} 278-287.
\bibitem{KRT3} K. M. Koh, D. G. Rogers and T. Tan, Products of graceful 
trees, {\it Discrete Math.}, {\bf 31} (1980) 279-292.
\bibitem{KRTY} K. M. Koh, D. G. Rogers, H. K. Teo and K. Y. Yap, Graceful
graphs: some further results and problems, {\it Congress. Numer.}, 
{\bf 29} (1980) 559-571.
\bibitem{KY} K. M. Koh and K. Y. Yap, Graceful numberings of cycles with a
$P_{3}$-chord, {\it Bull. Inst. Math. Acad. Sinica,} {\bf 12} (1985) 41--48.
\bibitem{KLS}
M. C. Kong, S-M  Lee and H.S.H.  Sun, 
On magic strength of graph,
{\it Ars Combin.,} {\bf 45} (1997) 193--200.
\bibitem{K1} A. Kotzig, Decompositions of a complete graph into $4k$-gons 
(in Russian), {\it {Matematick\'{y} Casopis}}, {\bf {15}} 
(1965) 229-233.
\bibitem{K2} A. Kotzig, $\beta$-valuations of quadratic graphs with
isomorphic components, {\it Utilitas Math.}, {\bf 7} (1975) 263-279.
\bibitem{K3} A. Kotzig, Decomposition of complete graphs into 
isomorphic cubes, {\it J. Comb. Theory, Series B,} {\bf 31} (1981) 292-296.
\bibitem{K4} A. Kotzig, Recent results and open problems in graceful
graphs, {\it Congress. Numer.,} {\bf 44} (1984) 197-219.
\bibitem{KR1} A. Kotzig and A. Rosa, Magic valuations of 
finite graphs, {\it {Canad. Math. Bull.}}, {\bf {13}} (1970) 451-461.
\bibitem{KR2} A. Kotzig and A. Rosa, Magic valuations of complete graphs, 
Centre de Recherches Mathematiques, Universite de Montreal, (1972) CRM-175. 
\bibitem{KT} A. Kotzig and J. Turgeon, $\beta$-valuations of regular 
graphs with complete components, {\it Colloq. Math. Soc. J\'{a}nos Bolyai 
18, 
Combinatorics}, Keszth\'{e}ly, Hungary, 1976.
\bibitem{Kov1}  P.~Kov\'{a}\v{r}, personal communication.
\bibitem{KrMN} J. Kratochvil, M. Miller and H. Nguyen, Sum graph labels--An 
upper bound and related problems, preprint. 
\bibitem{Kr} J. W. Krussel, Equitable labelling of complete bipartite graphs,
{\it Ars Combin.}, to appear.
\bibitem{KLMW} Q. Kuang, S. M. Lee, J. Mitchem and A-G. Wang, On edge-graceful
unicyclic graphs, {\it Congress Numer.} {\bf 61} (1988) 65-74.
\bibitem{KCK} D. Kuo, G. Chang, Y.-H. Kwong, Cordial labeling of $mK_n$, 
{\it Discrete Math.}, {\bf 169} (1997) 121-131.
\bibitem{LV} D.R. Lashmi and S. Vangipuram, An $\alpha$-valuation of 
quadratic graph $Q(4,4k)$, {\it Proc. Nat. Acad. Sci. India} Sec. A, {\bf 
57} (1987) 576-580.
\bibitem{LLC} H. Y. Lee, H. M. Lee and 
G. J. Chang, Cordial 
labelings of graphs, {\it Chinese J. Math.,} {\bf 20} (1992) 263-273.
\bibitem{LLM} L. M. Lee, S. M.  Lee and G. Murthy, On edge-graceful
labelings of complete graphs--solution of Lo's conjecture, {\it Congress.
Numer.}, {\bf 62} (1988) 225-233.
\bibitem{L1} S. M. Lee, $k$-graceful
labelling of Mongolian
tents and related graphs, {\it Congress. Numer.}, {\bf 50} (1985) 85-96.
\bibitem{L2} S. M. Lee, A conjecture on edge-graceful trees,
{\it Scientia}, {\bf 3} (1989) 45-47.
\bibitem{L3} S. M. Lee, New directions in the theory of edge-graceful
graphs, {\it Proc. 6th Caribbean Conf.  Combin. \& Computing} (1991)
216-231.
\bibitem{LLWK} S. M. Lee, K. Y. Lai, Y. S. Wang and M. K. Kiang,
On the graceful permutation graphs conjecture,
Proceedings of the Twenty-fifth Southeastern International Conference on 
Combinatorics,
Graph Theory and Computing (Boca Raton, FL, 1994),
{\it Congress. Numer.},  {\bf 103} (1994), 193--201.
\bibitem{LLSW} S.M. Lee, A. N-T. Lee, H. Sun and I. Wen, On the 
integer-magic spectra of graphs,  {\it J. Combin. Math. Combin. 
Computing,}  {\bf 42} (2002) 77--86. 
\bibitem{LeLe} S. M. Lee and A. Lee, On super edge-magic unicyclic graphs,
preprint. 
\bibitem{LeL} S. M. Lee and A. Liu, A construction of cordial graphs from 
smaller cordial graphs, {\it Ars Combin.}, {\bf 32} (1991) 209-214. 
\bibitem{LK} S. M. Lee and M. C. Kong, On super edge-magic $n$-stars,
 {\it J. Combin. Math. Combin. Computing} 
 {\bf 42} (2002) 87--96.
\bibitem{LNK} S. M. Lee and K. C. Ng, Every Young tableau graph is 
$d$-graceful, {\it Combinatorial Math. Annal.,} New York Acad. Sci., {\bf 
555} (1989) 296--302.
\bibitem{LNH} S. M. Lee and H. K. Ng, A class of $k$-graceful bipaartite
planar graphs, preprint.
\bibitem{LPC} 
 S. M. Lee, W. M. Pigg, and T. J.  Cox, T. J.,
On edge-magic cubic graphs conjecture, 
Proceedings of the Twenty-fifth Southeastern International Conference on 
Combinatorics,
Graph Theory and Computing (Boca Raton, FL, 1994),
{\it Congress Numer.}, {\bf 105} (1994), 214--222.
\bibitem{LQW} S. M. 
Lee, L. Quach and S. Wang, On 
Skolem-gracefulness of graphs which are disjoint union of paths and 
stars,  {\it{Congress. Numer.}}, {\bf 61} (1988) 59-64.
\bibitem{LSS} S. M.
Lee, F.  Saba and  G. C. Sun, 
Magic strength of the $k$th power of paths,
{\it Congress Numer.}, {\bf 92} (1993) 177--184.
\bibitem{LeSa} S. M. Lee and E. Salehi, Integer-magic spectra of 
amalgamations of stars and cycles, {\it Ars Combin.,} {\bf 67} (2003) 
199-212.
\bibitem{LSchS} S. M. Lee, E. Schmeichel and S.C. Shee, On felicitous 
graphs, {\it {Discrete Math.,}} {\bf {93}} (1991) 201-209.
\bibitem{LSe1} S. M. Lee and E. Seah, On edge-gracefulness  of 
$k$th power cycles, {\it Congress. Numer.}, {\bf 71} (1990) 237-242.
\bibitem{LSe2} S. M. Lee and E. Seah, Edge-gracefulness labelings of 
regular complete $K$-partite graphs, {\it Congress Numer.,} {\bf 75} 
(1990) 
41-50. 
\bibitem{LSe3} S. M. Lee and E. Seah, On edge-gracefulness of composition 
of step graphs and null graphs, {\it Graph Theory, Combinatorics,
Algorthms, 
and Applications (San Francisco, 1989)}, SIAM (1991) 325-330.
\bibitem{LSe4} S. M. Lee and E. Seah, On edge-graceful triangular snakes and 
sunflower graphs, preprint. 
\bibitem{LSL} S. M. Lee, E. Seah and S.-P. Lo, On edge-graceful 
$2$-regular graphs, preprint.
\bibitem{LST} S. M. Lee, E. Seah and S. K. Tan, On edge-magic graphs,
{\it Congress. Numer.,} {\bf 132} (1992), 179-191. 
\bibitem{LSW} S. M. Lee, E. Seah, P.-C. Wang,  On edge-gracefulness of 
$k$th power graphs, {\it Bull. Inst. Math. Acad. Sinica,} {\bf 18} (1990) 
1-11.
\bibitem{LSha} S. M. Lee and Q. X. Shan, All trees with at most 17 
vertices are super edge-magic, {\it 16th MCCCC Conference}, Carbondale, 
University Southern Illinois, Nov. 2002.
\bibitem{LShe} S. M. Lee and S.C. Shee, On Skolem-graceful graphs, {\it
 Discrete Math.,} {\bf 93} (1991) 195-200. 
\bibitem{LT} 
S. M. Lee 
and S. K. Tan, A class of arbitrarily graceful planar bipartite graphs, 
{\it J. Combin. Math. Combin. Comput.,} {\bf 9} (1991) 119-127.
\bibitem{LTS} S. M. Lee, S. M. Tong and E. Seah, On the edge-magic and
edge-graceful total graphs conjecture, {\it Congress Numer.,} {\bf 141} 
(1999)
37-48.
\bibitem{LW} S. M. Lee and G. Wang, All pyramids, lotuses and diamonds
are $k$-graceful, 
{\it Bull. Math. Soc. Sci. Math. R. S. Roumanie (N.S.),} {\bf 32} (1988), 
 145-150.
\bibitem{LWa} S. M. Lee and P. Wang, On the $k$-gracefulness of the 
sequential join of null graphs, {\it {Congress Numer.}}, {\bf 
{71}} (1990) 
243-254.
\bibitem{LWW} S. M.  Lee, S.  Wang and I. Wui, 
On Skolem-gracefulness of $4$-stars,
{\it Congress Numer.,} {\bf 62} (1988) 235--239.
\bibitem{LeWo} S. M. Lee and H. Wong, On the integer spectra  of the 
power of paths,  {\it J. Combin. Math. Combin. Computing,} 
 {\bf 42} (2002) 187--194.
\bibitem{LWK} S. M. Lee, Y. S. Wong and M. K. Kiang, On graceful 
permutations graphs conjecture, 
Proceedings of the Twenty-fifth Southeastern International Conference on Combinatorics, 
Graph Theory and Computing (Boca Raton, FL, 1994). 
{\it Congress Numer.,}  {\bf 103} (1994) 193--201. 
\bibitem{LWu} S. M. Lee and I. Wui, On Skolem-gracefulness of 2-stars 
and 3-stars, {\it{Bull. Malaysian Math. Soc.}}, {\bf {10}} (1987) 15-20.
\bibitem{LWY} S. M. Lee, I. Wui and J. Yeh, On the amalgamation of 
prime graphs, {\it {Bull. Malaysian Math. Soc. (Second Series),}} 
{\bf{11}} (1988) 59-67.
\bibitem{LL} H. X. Liang and C. F. Liu, On $k$-gracefulness of graphs, 
{\it Dongbei Shida Xuebao}, {\bf 33} (1991) 41-44.
\bibitem{Li1}  
 Z. Liang,
 The harmoniousness of book graph  $St(4k+1) \times P_2$,
 {\it Southeast Asian Bull. Math.}, {\bf 21} (1997) 181-184.
\bibitem{Li2}  
 Z. Liang, On the gracefulness of the graph $C_m \cup P_n$,
 {\it Ars Combin.,} {\bf 62} (2002) 273-280.
\bibitem{LSX} Z. H. Liang, D.Q. Sun and R.J. Xu, $k$-graceful 
labelings of the wheel graph $W_{2k}$, {\it J. Hebei Normal College}, 
{\bf 1} (1993) 33-44.
\bibitem{LKC} S.-C. Liaw, D. Kuo and G. Chang, Integral sum numbers of
graphs, {\it Ars Combin.,} {\bf 54} (2000) 259-268.
\bibitem{Lih}K.-W Lih, On magic and consecutive labelings of plane
graphs, {\it Utilitas Math.,} {\bf 24} (1983) 165-197.
\bibitem{LM} Y. Lin and M. Miller,
 Vertex magic total labellings
of complete graphs, {\it Bull. Inst. Combin. Appl.,} {\bf 33} (2001), 
68--76. 
\bibitem{LMSS} Y. Lin, M. Miller, R. Simanjuntak and Slamin, Magic and 
antimagic lableings of wheels, preprint. 
\bibitem{LiuB1} B. Liu, Some new results on graceful graphs, {\it Math. 
Appl.,}
{\bf 3} (1990) 108-110.
\bibitem{LiuB2} B. Liu,
Sums of squares and labels of graphs, {\it Math. Practice 
Theory}, (1994) 25-29.
\bibitem{LiuR} R. Y. Liu, On Bodendiek's conjecture 
for 
graceful graphs, {\it Chinese Quart. J. Math.,} {\bf 4} (1989) 67-73.
\bibitem{LiuY1} Y. Liu, The gracefulness of the star graph with top sides, 
{\it J. Sichuan Normal Univ.}, {\bf 18} (1995) 52-60. 
\bibitem{LiuY2} Y. Liu, Proof of a conjecture concerning gracefulness 
of graphs, {\it Huaihua Shizhuan Xuebao}, {\bf 15} (1996) 13-25.
\bibitem{LiuY3} Y. Liu, Crowns graphs $Q_{2n}$ are harmonious graphs,
{\it Hunan Annals Math.}, {\bf 16} (1996) 125-128.
\bibitem{LiuY4} Y. Liu, 
All crowns and helms are harmonious, preprint.
\bibitem{LiuZ} Z. S. Liu, A class of graceful graphs and two classes of
graceful graphs derived from it,
{\it Neimenggu Daxue Xuebao,} {\bf 16} (1985) 183-186.
\bibitem{LZ1} B. Liu and X. Zhang, On a conjecture of harmonious 
graphs, {\it {Systems Science and Math. Sciences}}, {\bf {4}} (1989) 325-328.
\bibitem{LZ2} B. Liu and X. Zhang, On harmonious labelings of graphs, 
{\it Ars Combin.},  {\bf 36} (1993) 315-326.
\bibitem{Lo} S. Lo, On edge-graceful labelings of graphs, {\it 
{Congress Numer.}}, {\bf{50}} (1985) 231-241.
\bibitem{LLi} X. Lu and X. F. Li,  $P_1\bigvee T_m$ graphs and a 
certification of its gracefulness, {\it Gongcheng Shuxue Xuebao}, {\bf 13} 
(1996) 109-113.  
\bibitem{Ma} X. Ma, A graceful numbering of a class of graphs, {\it {J. 
Math. Res. and Exposition}}, (1988) 215-216.
\bibitem{MF1} K. J.  Ma  and C. J. Feng, About the Bodendiek's
conjecture of graceful graph, {\it J. Math.\ Research and Exposition},
 {\bf 4} (1984) 15-18.
\bibitem{MF2} K. J. Ma and C. J. Feng, On the gracefulness of gear   
graphs, {\it Math. Practice Theory}, (1984) 72--73.
\bibitem{MLL} X. Ma, Y. Liu and W. Liu, Graceful graphs: cycles with $(t 
-1) $ chords, {\it Math. Appl.}, {\bf 9} (1990), suppl., 6--8.
\bibitem{MMSW} J. A. MacDougall, M. Miller, Slamin and W.D. Wallis,
Vertex-magic total labelings of graphs, 
{\it  Utilitas Math.,} {\bf 61} (2002) 3-21. 
\bibitem{MMW} J. A. MacDougall, M. Miller and W.D. Wallis,
Vertex-magic total labelings of wheels and related graphs,
{\it  Utilitas Math.,} {\bf 62} (2002) 175--183.
\bibitem{Mah} M. Maheo, Strongly graceful graphs, {\it Discrete Math.,} 
{\bf 29} (1980) 39-46.
\bibitem{MT} M. Maheo and H. Thuillier, On $d$-graceful graphs, {\it Ars Combin.,} {\bf 13} 
(1982) 181-192.
\bibitem{MW} J. McSorley and W.  Wallis,
On the spectra of totally magic labelings,
{\em Bull. Inst. Combin. Appl.,} {\bf 37} (2003) 58--62.
\bibitem{Mc} K. McTavish, personal 
communication.
\bibitem{MePy} L. S. Melnikov and A. V. Pyatkin. Regular integral sum graphs, 
{\it Discrete Math.}, {\bf 252} (2002) 237-245. 
\bibitem{Men2} E. Mendelsohn, 
Skolem labelled graphs,
{\it Discrete Math.,} {\bf 97} (1991) 301--317.
\bibitem{Men1} E. Mendelsohn, 
On Skolem labelling of windmills,
{\it Ars Combin.}, {\bf 53} (1999) 161--172.
\bibitem{Mi} M. Miller, Open problems 
in graph theory: labelings and
extremal graphs, preprint.
\bibitem{MB} M. Miller and M. Ba\v{c}a: Antimagic valuations of
generalized
Petersen
graphs, preprint.
\bibitem{MBL} M. Miller, M. Ba\v{c}a and Y. Lin: On two conjectures
concerning
$(a,d)$-antimagic labelings of antiprisms, 
{\it  J. Combin. Math. Combin. Comput.,} {\bf 37} (2001) 251--254.
\bibitem{MBM} M. Miller, M. Ba\v{c}a and J.A. MacDougall: Vertex-magic
total labeling
of generalized Petersen graphs and convex polytopes, preprint.
\bibitem{MRSl} M. Miller, J. Ryan and  Slamin, Integral sum 
numbers of cocktail party graphs and symmetric complete
bipartite graphs, {\it Bull. Inst. Combin. Appl.,} {\bf 25} (1999) 23--28. 
\bibitem{MRSS} M. Miller, J. Ryan, Slamin and W. Smyth, Labelling wheels 
for the minimum sum number,  {\it J. Combin. Math. Combin. Computing,} 
 {\bf 28} (1998) 289--297.
\bibitem{MRSm} M. Miller, J. Ryan and W. Smyth, The sum number of the 
cocktail party graph, {\it Bull. Inst. Combin. Appl.}, {\bf 22} (1998)
79--90.
\bibitem{MS} J. Mitchem and A. Simoson, On edge-graceful and 
super-edge-graceful graphs, {\it Ars Combin.}, {\bf 37} (1994) 97--111.
\bibitem{MoPa} M. Mollard and C. Payan, Elegant labelings and 
edge-colorings: A proof of two conjectures of Hartman, and Chang, Hsu, 
Rogers, {\it Ars Combin.,} {\bf 36} (1993) 97-106. 
\bibitem{MPS} M. Mollard, C. Payan and S. Shixin, Graceful problems, 
{\it Seventh Hungarian Colloquium on Finite and Infinite Combinatorics}, 
Budapest July 1987. 
\bibitem{Mor1} D. Morgan, All lobsters with perfect matchings are graceful, 
preprint.
\bibitem{Mor2} D. Morgan, Gracefully labeled trees from Skolem sequences,  
preprint.
\bibitem{MR} D. Morgan and R. Rees, Using Skolem and Hooked-Skolem sequences to 
generate graceful trees, {\it J. Combin. Math. Combin. Comput.,} {\bf 44} 
(2003) 
47-63. 
\bibitem{Mo} D. Moulton, Graceful labelings of triangular snakes, {\it 
{Ars Combin.}}, {\bf {28}} (1989) 3-13.
\bibitem{Mu} J. M\"{u}lbacher, Magische Quadrate und ihre 
Verallgemeinerung:
      ein graphen\-theoretisches Problem
      in: Graphs, Data Structures, Algorithms,
      Hensen Verlag, M\"{u}nchen, 1979.
\bibitem{MA1} M. Murugan and G. Arumugan, On graceful 
numberings of $nC_5$
with a common edge, preprint.
\bibitem{MA2} M. Murugan and G. Arumugan, An algorithm to find graceful 
numberings of a Spl. class of banana trees, preprint. 
\bibitem{MA3} M. Murugan and G. Arumugan, Bi-graceful graphs, preprint. 
\bibitem{MA4} M. Murugan and G. Arumugan, Are banana trees graceful?, 
preprint. 
\bibitem{NMS} H. Nagamochi, M. Miller and Slamin, Bounds on the number 
of isolates in sum graph labeling, {\it Discrete Math.,} {\bf 240} (2001)  175--185.
\bibitem{Na} D. Narayan, Problem 380. Representations of graphs modulo 
$n$, {\it Discrete Math.,} {\bf 257} (2002) 614. 
\bibitem{NP} J. Ne\v{s}et\v{r}il and A. Pultr, A Dushnik-Miller type dimension
of graphs and its complexity, in: M. Karpinski, Ed., Fundamentals  of
Computation Theory, Lecture Notes in Computer Science, {\bf 56}, Springer,
Berlin, 1977, 482-493.
\bibitem{N1} H. K. Ng, Gracefulness 
of a class of lobsters, {\it Notices AMS,} {\bf 7} (1986) 825-05-294.
\bibitem{N2} H. K. Ng, $\alpha$-valuations and $k$-gracefulness, {\it 
Notices AMS,} {\bf 7} (1986) 247.
\bibitem{NB} A. Ngurah and Baskoro, On magic and antimagic total labelings of 
generalized Petersen graph, {\it Utilitas Math.,} {\bf 63} (2003) 97-107.
\bibitem{NS} T. Nicholas and S. Somasundaram, More results on integral sum 
graphs, Proceedings of the National Conference on Graph Theory and its 
Applications held at Anna University, Chennai, 2001, to appear. 
\bibitem{NSV} T. Nicholas, S. Somasundaram and V. Vilfred, On 
$(a,d)$-antimagic 
special trees, unicyclic graphs and complete bipartite graphs, {\it Ars 
Combin.,} to appear. 
\bibitem{NV} T. Nicholas and V. Vilfred, Sum graph and edge reduced sum 
number, preprint. 
\bibitem{NW} R. Nowakowski and C. Whitehead,  Ordered graceful
labellings of the 2-star, Graph theory (Prague, 1998), {\it Discrete Math.,} 
{\bf 233} (2001) 183--191. 
\bibitem{PR} A. M. Pastel and H. Raynaud, Numerotation 
gracieuse des oliviers, in 
{\it Colloq. Grenoble},  Publications Universit\'{e} de Grenoble, (1978) 
218-223.
\bibitem{PS} K. Petrie and B. Smith, 
http://scom.hud.ac.uk/scombms/Graceful.
\bibitem{PRW1} N. C. K. Phillips, R. S. Rees and W. D. Wallis,
Edge-magic
total labelings of wheels, {\it Bull. Inst. Combin. Appl.}, {\bf  31} (2001), 
21--30.
\bibitem{PRW2} N. C. K. Phillips, R. S. Rees and W. D. Wallis,
personal communication.
\bibitem{Pi1} O. Pikhurko, Every Tree with at most 34 vertices is prime,
{\it  Utilitas Math.}, {\bf 62} (2002) 185-190. 
\bibitem{Pi2} O. Pikhurko, Trees are almost prime, preprint,\\
(\verb;http://www.pmms.cam.ac.uk/~oleg/Papers/TreesAreAlmostPrime.ps;).
\bibitem{PoS} S. Poljak and M. S\^{u}ra, An algorithm for grwceful 
labeling of a class of symmetrical trees, {\it Ars Combin.}, {\bf 14} 
(1982) 57-66.
\bibitem{PP} N. Punnim and N. 
Pabhapote, On graceful graphs: cycles with a $P_k$-chord, $k \geq 4$,
{\it Ars Combin.,} {\bf 23A} (1987) 225-228.
\bibitem{Py} 
A.  Pyatkin,New formula for the sum number for the complete
bipartite graphs, {\it Discrete Math.,} {\bf 239} (2001) 155--160.
\bibitem{Q} J. Qian, On some conjectures and problems in graceful 
labelings graphs, preprint.
\bibitem{RP1} I. Rajasingh and P. R. L. Pushpam,
Strongly harmonious labeling of helms, preprint.
\bibitem{RP2} I. Rajasingh and P. R. L. Pushpam,
On graceful and harmonious labelings of $t$ copies of $K_{m,n}$ and other 
special graphs, preprint.
\bibitem{Ra} J. L. Ram\'{\i}rez-Alfons\'{\i}n, Gracefulness of replicated paths and
cycles, {\it Ars Combin.,} {\bf 53} (1999) 257-269.  
\bibitem{Re} M. Reid, personal communication.
\bibitem{Ri} G. Ringel, Problem 25,  in  
Theory of Graphs and 
its Applications, {\it Proc. Symposium Smolenice 1963}, Prague (1964) 162.
\bibitem{RL} G. Ringel and  A. Llado, Another tree 
conjecture, 
{\it Bull. Inst. Combin. Appl.,}
 {\bf 18} (1996) 83-85. 
\bibitem{RLS} G. Ringel, A. Llado and O. Serra, Decomposition of 
complete bipartite graphs into trees, DMAT Research Report 11/96, Univ. 
Politecnica de Catalunya.
\bibitem{RB} Y. Roditty and T. Bachar, A note on edge-magic cycles,
{\it Bull. Inst. Combin. Appl.,}
 {\bf 29} (2000) 94-96.
\bibitem{Rop} D. Ropp, Graceful labelings of cycles and 
prisms with pendant
points, {\it Con\-gress. Numer.,} {\bf 75} (1990) 218-234.
\bibitem{Ro1} A. Rosa, On certain valuations of the vertices of a graph,
{\it Theory of Graphs (Internat. Symposium, Rome, July 1966)}, Gordon and Breach,
N. Y. and Dunod Paris (1967) 349-355.
\bibitem{Ro2} A. Rosa, Cyclic Steiner triple systems and labelings of
triangular cacti, {\it Scientia}, {\bf 1} (1988) 87-95.
\bibitem{RS} A. Rosa and J. \v{S}ir\'{a}\v{n}, Bipartite labelings 
of trees and the gracesize, {\it J. Graph Theory}, {\bf 19} 
(1995) 201-215.
\bibitem{Sa} H. Salmasian, A result on prime labelings of trees, {\it Bull.
Inst. Combin. Appl.,} {\bf 28} (2000) 36-38.
\bibitem{ST} \v{L}. \v{S}\'andorov\'a and  M.Trenkl\'er,
          On a generalization of magic graphs,
          {\it Colloquia Math. Societatis J.Bolyai}, {\bf 52}
          Combinatorics, 
          North-Holland, Amsterdam 1988, 447-452.
\bibitem{SaSi1} G. Santhosh and G. Singh, A note on subdivision of integral 
sum graphs, preprint.
\bibitem{SaSi2} G. Santhosh and G. Singh, On divisor graphs, preprint.
\bibitem{ScL} K. Schaffer and S. M. Lee, Edge-graceful and edge-magic 
labelings of Cartesian products of graphs, {\it Congress Numer.} {\bf 141} 
(1999) 
119-134. 
\bibitem{Se1} J. Sedl\'a\v{c}ek, Problem 27, {\it in} Theory of Graphs 
and its Applications, {\it Proc. Symposium Smolenice,} June, (1963) 163-167.
\bibitem{Se2} J. Sedl\'a\v{c}ek, On magic graphs, {\it Math. Slov.,} 
{\bf 26} (1976) 329-335.
\bibitem{Sek} C. Sekar, Studies in Graph Theory, Ph.D. Thesis, 
Madurai Kamaraj University, 2002.
\bibitem{SAS1} M. Seoud, A.E. I. Abdel Maqsoud and J. Sheehan, Harmonious
graphs, {\it Utilitas Math.}, {\bf 47} (1995) 225-233.
\bibitem{SA2} M. Seoud and  A.E. I. Abdel Maqsoud, On cordial and
balanced labelings of graphs,
{\it J. Egyptian Math. Soc.,} {\bf 7} (1999) 127--135.
\bibitem{SA1} M. Seoud and  A.E. I. Abdel Maqsoud, On 3-equitable and
magic labelings, preprint. 
\bibitem{SAS2} M. Seoud, A.E. I. Abdel Maqsoud and J. Sheehan, 
Gracefulness of the union of cycles and paths, {\it Ars Combin.,} {\bf 54}
(2000)
283-292.
\bibitem{SDE} M. A. Seoud, A. T. Diab  and E. A. Elsahawi,
On strongly-$C$ harmonious, relatively prime, odd graceful and cordial 
graphs, {\it Proc.
Math. Phys. Soc. Egypt,}  No. 73 (1998) 33--55. 
\bibitem{SeE1} M. A. Seoud and E. A. Elsahawi, On almost graceful,
felicitous and elegant  graphs, {\it J. Egyptian Math. Soc.,} {\bf 7}
(1999) 137--149.
\bibitem{SeE2} M. A. Seoud and E. A. Elsahawi, On strongly $c$-elegant
graphs, preprint.
\bibitem{SeWi} M. Seoud 
and R. J.  Wilson, Some disgraceful graphs, {\it Int. J. Math. Ed. 
Sci. Tech.,}
 {\bf 24} (1993) 435-441.
\bibitem{SY3} M. Seoud and M. Youssef,
On labelling complete tripartite graphs, {\it Int. J. Math.  Ed. Sci. 
 Tech.}, {\bf 28} (1997) 367-371.
\bibitem{SY6} M.A.
Seoud and M.Z. Youssef, On prime labelings of graphs,
{\it  Congress Numer.,}  {\bf 141} (1999) 203--215. 
\bibitem{SY7} M.A. Seoud and M.Z. Youssef, Families of
harmonious and non-harmonious graphs,
{\it J. Egyptian Math. Soc.,} {\bf 7} (1999) 117--125.
\bibitem{SY5} M. Seoud and M. Youssef, New families of graceful
disconnected graphs, {\it Ars Combin.}, {\bf 57} (2000) 233-245.
\bibitem{SY8} M.A. Seoud and M.Z. Youssef, On
harmonious  graphs of order 6, {\it Ars Combin.,} 
{\bf  65}  (2002) 155--176.
\bibitem{SY4} M. Seoud and M. Youssef,
The effect of some operations on labelling of graphs, {\it Proc. Egyptian Phys. 
Math. Soc.,} to appear.
\bibitem{SY1} M. Seoud and M. Youssef, Harmonious labellings of helms and 
related graphs, preprint.
\bibitem{SY2} M. Seoud and M. Youssef,
On gracefulness of disconnected graphs, preprint.
\bibitem{SeZi} M. Seoud and A. Zid, Strong multiplicativity of unions and 
corona of paths and complete graphs, {\em Proc. Math. Phys. Soc. Egypt,}
{\bf 74} (1999) 59-71.
\bibitem{SD1} G. Sethuraman and R. Dhavamani, Graceful numbering of an
edge-gluing of shell graphs, {\it Discrete Math.,} {\bf 218} 283-287.
\bibitem{SD2} G. Sethuraman and R. Dhavamani, Graceful numbering of union
of shell graphs, preprint. 
\bibitem{SE1} G. Sethuraman and A. Elumalai, On graceful graphs: Pendant edge 
extensions of a family of complete bipartite and complete tripartite graphs,
{\it Indian J. Pure Appl. Math.,} {\bf 32} (2001) 1283-1296. 
\bibitem{SE2} G. Sethuraman and A. Elumalai, Graceful, harmonious and elegant 
labellings on star extension graphs, preprint. 
\bibitem{SE3} G. Sethuraman and A. Elumalai, Every graph is a vertex induced 
subgraph of a graceful graph and elegant graph, preprint. 
\bibitem{SE4} G. Sethuraman and A. Elumalai, Elegant labelled graphs, 
preprint.
\bibitem{SK} G. Sethuraman and
 S. P. M. Kishore, On graceful graphs:
Union of $n$ copies of edge deleted subgraphs of $K_4$, {\it Indian J. Pure 
Appl. Math.,} {\bf 30} (1999) 801--808.
\bibitem{SS1} G. Sethuraman and P. Selvaraju,  Gracefulness of arbitrary 
supersubdivisions of graphs, {\it Indian J. Pure Appl. Math.,} {\bf 32} (2001) 
1059--1064. 
\bibitem{SS2} G. Sethuraman and P. Selvaraju, 
 On graceful graphs: one vertex unions of 
non-isomorphic complete bipartite graphs, {\it Indian J. Pure Appl. Math.,} {\bf 
32} (2001) 975--980.
\bibitem{SS4} G. Sethuraman and P. Selvaraju, Decompositions of complete 
graphs and complete  bipartite graphs into isomorphic supersubdivision 
graphs, {\it Discrete Math.,} {\bf 260} 137--149. 
\bibitem{SS5} G. Sethuraman and P. Selvaraju,
One edge union of 
shell graphs and one vertex union of complete bipartite graphs 
are cordial, {\it Discrete Math.,}  {\bf 259}  (2002) 343--350.
\bibitem{SS3} G. Sethuraman and P. Selvaraju, 
Super-subdivisions of connected graphs are graceful, preprint.
\bibitem{SS6} G. Sethuraman and P. Selvaraju, On graceful graphs I: Union of 
non-isomorphic complete bipartite graphs with one vertex in common, preprint.
\bibitem{SS7} G. Sethuraman and P. Selvaraju, New classes of graphs on graph 
labeling, preprint. 
\bibitem{SS8} G. Sethuraman and P. Selvaraju, On harmonious and felicitous graphs: 
Union of $n$-copies of edge deleted subgraphsof $K_4$, preprint.
\bibitem{SSE} G. Sethuraman, P. Selvaraju and A. Elumalai, On 
harmonious, 
felicitous, elegant and cordial graphs: Union of $n$ copies of edge deleted 
subgraphs of $K_4$, preprint. 
\bibitem{Sha} A. Sharary, 
Integal sum graphs from complete graphs, cycles and wheels,
{\it Arab Gulf Sci. Res.,} {\bf 14-1} (1996) 1--14.
\bibitem{S1} S. C. Shee, On 
harmonious and related graphs, {\it Ars Combin.,} {\bf 23} (1987) A, 
237-247.
\bibitem{S2} S. C. Shee, Some results on {$\lambda$}-valuation of graphs 
involving complete bipartite graphs, {\it Discrete Math.,} {\bf 28} 
(1991) 73-80.
\bibitem{SH1} S. C. Shee and Y. S. Ho, 
The cordiality of one-point union 
of $n$-copies of a graph, {\it Discrete Math.,} {\bf 117} (1993) 225-243. 
\bibitem{SH2} S. C. Shee and Y. S. Ho, The cordiality of the path-union 
of $n$ copies of a graph, {\it Discrete Math.,} {\bf 151} (1996) 221-229. 
\bibitem{ShL} S. Shee and S. Lee, On harmonious and felicitious
labeling of graphs, {\it Congress. Numer.,} {\bf 68} (1989) 155-170.
\bibitem{Sh} D. A. Sheppard, The factorial representation of major
balanced
labelled graphs,  {\it Discrete Math.,} {\bf 15} (1976) 379-388.
\bibitem{Shi} H. Shimazu, Graceful labelling of the union of cycles and paths, 
preprint.
\bibitem{SLC2} W. C. Shiu, P. C. B. Lam and H. L. Cheng, 
Supermagic labeling of an $s$-duplicate of $K\sb {n,n}$, 
Proceedings of the Thirty-first Southeastern International Conference on 
Combinatorics,
Graph Theory and Computing (Boca Raton, FL, 2000),
{\it Congress Numer.,} {\bf 146} (2000) 119--124.
\bibitem{SLC1} W. C. Shiu, P. C. B. Lam and H. L. Cheng, Edge-gracefulness
of the composition of paths with the null graphs, {\it Discrete Math.,}
{\bf 253} (2002) 63-76.
\bibitem{SLL1} W. C. Shiu, P. C. B. Lam and S. M. Lee, Edge-magic index
sets of $(p,p)$-graphs, {\it Congress Numer.,} {\bf 136} (1999) 201-205.
\bibitem{SLL2} W. C. Shiu, P. C. B. Lam and S. M. Lee, On 
construction of supermagic graphs,  {\bf 42} (2002) 147--160. 
\bibitem{SLL3} W. C. Shiu, P. C. B. Lam and S. M. Lee, Edge-magic indices
of $(p,p-1)$-graphs, preprint. 
\bibitem{ShLe} W. C. Shiu and S. M. Lee, Some edge-magic cubic graphs,
{\it  J. Combin. Math. Combin. Comput.,} {\bf 40} (2002) 115-127. 
\bibitem{SLS} W. C. Shiu, S. M. Lee and K. Schaffer, Some $k$-fold
edge-graceful labelings of $(p,p-1)$-graphs,  
{\it  J. Combin. Math. Combin. Comput.,} {\bf 38} (2001), 
81--95. 
\bibitem{ShY} S. Shixin and S. Yu, On Hamming-graceful graphs, preprint.
\bibitem{SBM} R. Simanjuntak, F. Bertault and M. Miller,
Two new $(a,d)$-antimagic graph labelings, preprint. 
\bibitem{SRM} R. Simanjuntak, C. Rodgers and M. Miller,
On distance magic graphs, preprint. 
\bibitem{Si} G. J. Simmons, 
Synch-sets: a variant of difference sets,
{\it Proc. 5th Southeastern Conference on Combinatorics, Graph Theory and 
Computing},
Utilitas Math. Pub. Co., Winnipeg (1974) 625-645.
\bibitem{Sin1} G. S. Singh, A note on graceful prisms, {\it Nat. Acad. 
Sci. Lett.,} {\bf 15} (1992) 193-194.
\bibitem{Sin3} G. S. Singh, Subdivisions of ladders are arithmetic, {\it 
Multidiscplinary Research Review,} {\bf 2} (1992) 23-25.
\bibitem{Sin2} G. S. Singh, A note on sequential crowns, {\it Nat. Acad. 
Sci. Lett.,} {\bf 16} (1993) 243-245.
\bibitem{Sin4} G. S. Singh, A note on labeling of graphs, {\it Graphs 
and Combin.}, {\bf 14} (1998) 201-207.
\bibitem{Sin5} G. S. Singh, private communication.
\bibitem{Sin6} G. S. Singh, Some generalities on arithmetic graphs,
{\it Graph Theory Notes of New York,} {\bf XXXVIII} (2000) 12-16.
\bibitem{SD} G. Singh and J. Devaraj, On triangular graceful graphs, preprint. 
\bibitem{SiSa} G. S. Singh and G. Santhosh, A note on integral sum crowns,
{\it Ars Combin.,} {\bf 66} (2003) 65-77. 
\bibitem{SiVa} G. S. Singh and T. K. M. Varkey, On odd sequential and 
bisequential graphs,  preprint.
\bibitem{SiVi} G. S. Singh and V. Vilfred, Some results on arithmetic
trees, preprint.
%\bibitem{SVU} N. M. Singhi, G. R. Vijayakumar and N.  Usha Devi,
%Set-magic labelings of infinite graphs.
%{\it Ars Combin.,} {\bf 63} (2002) 305--310.
\bibitem{Sk} T. Skolem, On certain distribution of integers into pairs 
with given differences, {\it Math. Scand.}, {\bf 5} (1957) 57-68.
\bibitem{SBLMS} Slamin, M. Ba\v{c}a, Y.Lin, M. Miller and R. Simanjuntak, 
Edge-magic total
labekings of wheels, fans and friendship graphs, preprint.
\bibitem{SlM} Slamin and M. Miller, On two conjectures concerning
vertex-magic total labelings of generalized Petersen graphs, {\it Bull. Inst. 
Combin.
Appl.,} {\bf 32} (2001) 9--16. 
\bibitem{Sl1} P. J. Slater, On $k$-sequential and other numbered graphs,
{\it Discrete Math.,} {\bf 34} (1981) 185-193.
\bibitem{Sl2} P. J. Slater, On $k$-graceful graphs, {\it Proc. of the 
13th S.E.
Conf. on Combinatorics, Graph Theory and Computing,} (1982) 53-57.
\bibitem{Sl3} P. J. Slater, On $k$-graceful, locally finite graphs, {\it J.
Comb. Theory, Series B,} {\bf 35} (1983) 319-322.
\bibitem{Sl4} P. J. Slater, Problems in graph theory: graceful and 
sequential
numbering of infinite graphs, {\it Southeast Asian Bull. Math.,} {\bf 9} 
(1985) 15-22.
\bibitem{Sl5} P. J. Slater, On $k$-graceful, countably infinite graphs,
{\it Discrete Math.,} {\bf 61} (1986) 293-303.
\bibitem{Sma} D. Small, Regular (even) spider graphs are edge-graceful, 
{\it 
Congrss. Numer.,} {\bf 74} (1990) 247-254.
\bibitem{Smy1} W. Smyth, Sum graphs of small sum number, {\it Colloquia
Mathematica Societatis J\'{a}nos Bolyai} {\bf 60} (1991) 669-678. 
\bibitem{Smy2} W. Smyth, Sum graphs: New results, new problems,  {\it Bull. Inst. Combin. Appl.,}
{\bf 2} (1991) 79-81.
\bibitem{Sn1} H. 
Snevily, Combinatorics of Finite Sets, Ph.D. Thesis, U. Illinois, 1991.
\bibitem{Sn2} H. Snevily, New families of graphs that 
have $\alpha$-labelings, {\it Discrete Math.},
 {\bf 
170} (1997) 185-194.
\bibitem{So} M. Sonntag, Antimagic vertex-labelling  of
hypergraphs, {\it Discrete Math.,} {\bf 247} (2002) 187-199. 
\bibitem{SoTe1} M. Sonntag and H.-M. Teichert, Sum numbers of hypertrees,
{\it Discrete Math.,}  {\bf 214} (2000) 285-290.
\bibitem{SoTe2} M. Sonntag and H.-M. Teichert, On the sum number and integral 
sum
number  of hypertrees and complete hypergraphs,
{\it Discrete Math.,} 236 (2001) 339-349.
\bibitem{SpS} D. Speyer and Z. Szaniszl\'{o}, Every tree is
$3$-equitable, {\it Discrete Math.,} {\bf 220} (2000) 283-289. 
\bibitem{StZa} R. Stanton and C. Zarnke, Labeling of balanced trees, {\it 
Proc. 4th Southeast Conf. Comb., Graph Theory, Computing} (1973) 479-495.
\bibitem{St1} B. M. Stewart, Magic  graphs, {\it Canadian J.
Math.,} {\bf 18} (1966) 1031-1059.
\bibitem{St2} B. M. Stewart, Supermagic complete graphs, {\it Canadian J.
Math.,} {\bf 19} (1967) 427-438.
\bibitem{Su} R. G. Sun,
Harmonious and sequential labelings of the book graphs $B\sb m$, 
{\it Gaoxiao Yingyong Shuxue Xuebao Ser. A}, {\bf 9} (1994) 335--337.
\bibitem{SuWa} D. Q. Sun and D.Y. Wang, private 
communication.
\bibitem{SGL} G. C. Sun, J. Guan and  S.-M. Lee,
A labeling algorithm for magic graph,
Proceedings of the Twenty-fifth Southeastern International Conference on
Combinatorics, Graph Theory and Computing (Boca Raton, FL, 1994).
{\it Congress Numer.} {\bf 102} (1994) 129--137.
\bibitem{SuL}  
G. C. Sun and S. M.  Lee, 
Construction of magic graphs,
{\it Congress Numer.}, {\bf 103} (1994) 243--251.
\bibitem{Sut} M. Sutton, Summable graphs labellings and their applications,
Ph. D. Thesis, Dept. Computer Science, The University of Newcastle, 2001.  
\bibitem{SDM} M. Sutton, A. Draganova and  M. Miller, Mod sum numbers of
wheels, {\it Ars Combin.}, {\bf 63} (2002) 273-287. 
\bibitem{SuM1} M. Sutton and  M. Miller, Mod sum 
graph labelling of $H_{n,n}$ and $K_n$, {\it Australasian J. Comb.,} {\bf
20} (1999) 233-240. 
\bibitem{SuM2} M. Sutton and  M. Miller, On the  sum number of wheels, 
{\it Discrete Math.,} {\bf 232} (2001) 185-188.
\bibitem{SMRS} M. Sutton, M. Miller, J. Ryan and Slamin, Connected graphs 
which are not mod sum graphs, {\it Discrete Math.,} {\bf 195} (1999) 287-293.
\bibitem{Sz} Z. Szaniszl\'{o}, $k$-equitable labellings of cycles and 
some other graphs, {\it Ars Combin.,} {\bf 37} (1994) 49-63.
\bibitem{Ta} R. Tao, On $k$-cordiality of cycles, 
crowns and wheels,  
 {\it Systems Sci. Math. Sci.,} {\bf 11} (1998) 227--229.
\bibitem{Tei1} H.-M. Teichert,
The sum number of $d$-partite complete hypergraphs,
{\it Discuss. Math. Graph Theory,} {\bf 19} (1999) 79--91.
\bibitem{Tei2} H.-M. Teichert, Classes of hypergraphs with sum number one, {\it
Disc. Math. Graph Theory,} {\bf 20} (2000) 93-103.
\bibitem{Tei3} H.-M. Teichert, Sum labellings of cycle hypergraphs, {\it Disc.
Math. Graph Theory}, to appear.
\bibitem{Tel} S. Telang, private communication.
\bibitem{Tre1} M. Trenkl\'er, Some results of magic graphs,
  graphs and other comb. topics,
   Teubner-Texte zur Mathematik - Band 59, Leipzig 1983, 328-332
\bibitem{Tre2} M. Trenkl\'er, Numbers of vertices and edges of magic
graphs, {\it Ars Combin.,} {\bf 55} (2000) 93-96.
\bibitem{Tre3} M. Trenkl\'er, Super-magic complete $n$-partite 
hypergraphs,
{\it Graphs and Combin.,} {\bf 17} (2001) 171-175. 
\bibitem{Tre4}  M. Trenkl\'er, Magic $p$-dimensional cubes,
{\it Acta Arithmetica} {\bf 96} (2001) 361-364.
\bibitem{TV} M. Trenkl\'er and V. Vetch\'{y}, Magic powers of
graphs, {\it Math. Bohemica,} {\bf 122} (1997) 121-124.
\bibitem{T} M. Truszczy\'{n}ski, Graceful 
unicyclic graphs, {\it Demonstatio Mathematica,} {\bf 17} (1984) 377-387.
\bibitem{V} K. Valentin, Polychrome labelings of trees and cycles, {\it
Ars Combin.,} {\bf 52} (1999) 272-284.
\bibitem{Van}F. Van Bussel, Relaxed graceful labellings of trees,
{\it Electronic J. Comb.}, {\bf 9} (2002) \#R4. (12 pages).
\bibitem{Var} T. Varkey, About prime labelings of graphs, preprint.
\bibitem{Vi} D. Vickrey, $k$-equitable labelings of complete bipartite 
and multipartite graphs, {\it Ars Combin.,} {\bf 54} (2000) 65-85.
\bibitem{Vil1} V. Vilfred, Families of graceful banana trees, {\it
Internat. J. Management and Systems}, to appear.
\bibitem{Vil2} V. Vilfred, Sigma partitions and sigma labeled graphs, preprint. 
\bibitem{ViJi} V. Vilfred and M. Jinnah, On sigma labeled graphs, preprint.
\bibitem{VSN} V. Vilfred, S. Somasundaram and T. Nicholas, Classes of prime 
graphs, {\it International J. Management and Systems}, to appear.
\bibitem{Wa} C. D. Wallace, Mod Sum Numbers of Complete Bipartite Graphs,
M.S. Thesis, East Tennessee State University, 1999.
\bibitem{Wal1} W. D. Wallis, Magic Graphs, Birkh\"{a}user, Boston, 2001.
\bibitem{Wal2} W. D. Wallis, Vertex magic labelings of multiple graphs, 
{\it Congress. Numer.,} {\bf 152} (2001) 81-83.
\bibitem{Wal3} W. D. Wallis, Two results of Kotzig on magic labelings, 
{\it Bull. Inst. Combin. Appl.,}
 {\bf 36} (2002) 23--28.
\bibitem{WBMS} W. D. Wallis, E. T. Baskoro, M. Miller and Slamin,
Edge-magic total labelings, preprint.
\bibitem{WJLZ}  
 J.-G. Wang, D. J.  Jin,  X.-G Lu, and D. Zhang, 
The gracefulness of a class of lobster trees,
{\it Math. Comput. Modelling}, {\bf 20} (1994) 105-110.
\bibitem{WL} Y.  Wang and B.  Liu, The sum number and integral sum 
number of complete bipartite graphs, {\it Discrete Math.,} {\bf 239} (2001)
 69--82. 
\bibitem{Wat} M. E. Watkins, A theorem on Tait colorings with an
application to the generalized Petersen graphs, {\it J. Combin. Theory,}
{\bf 6} (1969) 152-164.
\bibitem{WiBa} K. Wijaya and E. Baskoro, Edge-magic labelings of a 
product of two 
graphs (in Indonesian), {\it Proc. Seminar MIPA}, ITB Bandung Indonesia, October 
2000.
\bibitem{WR} S. Wilson and A. Riskin,
Edge-graceful labellings of
odd cycles and their products, {\it Bulletin of the ICA,} {\bf 24} (1998)
57-64.
\bibitem{Wi} S. Winters, personal communication.
\bibitem{W1} J. Wojciechowski, Long Induced Cycles in the Hypercube and 
Colourings of Graphs, Ph.D. Thesis, Cambridge University, England, 1990.
\bibitem{W2} J. Wojciechowski, Equitable labelings of cycles, {\it J. 
Graph Theory}, {\bf 17} (1993) 531-547.
\bibitem{Wo} D.  Wood, On vertex-magic and edge-magic
total injections of graphs, {\it Australas. J. Combin.,} {\bf 26} (2002) 
49--63.
\bibitem{WML} J. Wu, J. Mao and D. Li, New types of integral sum graphs,
{\it Discrete Math.,} {\bf 260} (2003) 163-176. 
\bibitem{Wu4} S.-L. Wu, Graceful labelings of graphs associated 
with vertex-saturated graphs, {\it Ars Combin.}, {\bf 62} (2002) 109-120.
\bibitem{Wu1} S.-L. Wu, A necessary condition for the existence of an
$\alpha$-labeling, preprint.
\bibitem{Wu2} S.-L. Wu, New graceful families on bipartite graphs,
preprint.
\bibitem{Wu3} S.-L. Wu, Graceful labelings of vertex-saturated graphs
and related graphs, preprint. 
\bibitem{XL} L. T. Xie and G. Z. Liu, A survey of 
the problem of graceful trees, {\it Qufu Shiyuan Xuebao,} (1984) 8-15.
\bibitem{XuB} B. Xu, On integral sum graphs, {\it Discrete Math.,}
{\bf 194} (1999) 285-294.
\bibitem{XuS1} S. D. Xu, Cycles with a chord are harmonious, 
{\it Mathematica Applicata}, {\bf 8} (1995) 31--37. 
\bibitem{XuS2} S. D. Xu, Harmonicity of triangular snakes, 
{\it J. Math. Res. Exposition}, {\bf 15} (1995) 475--476.
\bibitem{YL1} W. Yan and B. Liu, Some results on integral sum graphs, 
{\it  Discrete Math.,} {\bf 240} (2001) 219--229.
\bibitem{YL2} W. Yan and B. Liu, The sum number and integral sum number 
of complete bipartite graphs, preprint.
\bibitem{YLZ} Y. Yang, W. Lu and Q. Zeng, Harmonious graphs $C_{2k} \cup 
C_{2j + 1}$, {\it Utilitas Math.,} {\bf 62} (2002) 191-198. 
\bibitem{YW1} Y. C. Yang and X.G. Wang, On the gracefulness of the
 product $C_n 
\times P_2$, {\it J. Math. Research and Exposition,} {\bf 1} (1992) 
143-148.  
\bibitem{YW2} Y. C. Yang and X.G. Wang, 
On the gracefulness of the union of two stars and three stars,
{\it Combinatorics, Graph Theory, Algorithms and Applications (Beijing,
1993)}, 
417--424,
World Sci. Publishing, River Edge, NJ, 1994.
\bibitem{YW3} Y. C. Yang and X. G. Wang, 
On the gracefulness of product graph $C\sb {4n+2}\times P\sb {4m+3}$,
{\it Combinatorics, Graph Theory, Algorithms and Applications 
(Beijing, 1993)},
425--431,
World Sci. Publishing, River Edge, NJ, 1994.
%\bibitem{YLZ} Y. Yang, W. Lu and Q. Zeng, Harmonious graphs $C_{2k} \cup 
%C_{2j + 1}$, {\it Utilitas Math.,} {\bf 62} (2002) 191-198.
\bibitem{Ye1} V. Yegnanarayanan, On some additive analogues of graceful theme:
cycle-related graphs,  
{\it  Southeast Asian Bull. Math.,} {\bf 23} (1999) 317--333.
\bibitem{Ye2} V.  Yegnanarayanan, On  magic graphs. {\it Utilitas Math.,} 
{\bf 
59} (2001) 181--204.
\bibitem{YC} R. Yilmaz and I. Cahit, E-cordial graphs, {\it Ars Combin.,} 
{\bf 46} (1997) 251-266. 
\bibitem{Yo5} M. Z. Youssef, On graceful, harmonious and prime labelings of 
graphs, Ph. D. thesis, Department of Mathematics, Ain Shams University, 2000. 
\bibitem{Yo1} M. Z. Youssef, New familes of graceful graphs, {\it Ars 
Combin.,} {\bf 67} (2003) 303-311.
\bibitem{Yo2} M. Z. Youssef, Two general results on harmonious labelings,
{\it  Ars Combin.}, to appear.
\bibitem{Yo3} M. Z. Youssef, A necessary condition on $k$-equitable labelings, 
{\it Utilitas Math.,} to appear.
\bibitem{Yo4} M. Z. Youssef, On cordial labeling of graphs, preprint.
\bibitem{Yo6} M. Z. Youssef, personal communication.
\bibitem{Yu1} P. Yu, A proof of a conjecture about arithmetic graphs, 
{\it J. Math. Res. Exposition,} {\bf 16} (1996) 594-598. 
\bibitem{Yu2} P. Yu,  Strongly arithmetic graphs {\it Chinese Quart. J. 
Math.,} {\bf 15} (2000) 22--27.
\bibitem{YZ} J. Yuan and W. Zhu, Some 
results on harmonious labelings of graphs,
{\it J. Zhengzhou Univ. Nat. Sci. Ed.,} {\bf 30} (1998) 7-12.
\bibitem{ZhP} P. Zhang, Radio labelings of cycles, {\it Ars Combin.,}
{\bf 65} 2002 21--32.
\bibitem{Zha} S. L. Zhao, 
All trees of diameter four are graceful, {\it Graph Theory and its
Applications: East and West (Jinan, 1986)}, 700--706,
Ann. New York Acad. Sci., 576, New York Acad. Sci., New York, 1989.
\bibitem{Zhi} L. Zhihe, The balanced properties of bipartite graphs with
applications, {\it Ars Combin.,} {\bf 48} (1998) 283--288.
\bibitem{Zho} S. C. Zhou, 
Gracefulness of the graph $K\sb m\cup K\sb n$,
{\it J. Lanzhou Railway Inst.}, {\bf 12} (1993) 70--72.
\end{thebibliography} 

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% End of file
