referencesshodhganga.inflibnet.ac.in/bitstream/10603/97325/12/12_bibliography.pdf · references...
TRANSCRIPT
REFERENCES
[1). Abraham. J, Extensions of graceful valuations of 2-regular bipartite
graphs, Congress numerantium 84 (1991) pp. 51 - 59.
[2). Abraham. J, and Kotzig. A., All 2-regular graphs consisting of 4
cycles are graceful, Discrete maths 135 (1994) 1-14.
[3). Acharya. B.D. and Gill. M.K. On the index of gracefulness of a graph
and the gracefulness of two dimensional square lattice graphs,
Indian.J. Maths; 23 (1981) 81 - 94.
[4). Acharya. B.D., On d-sequential graphs, journal. Math.Phy.Sci.17
(1983) 21 - 35.
[5). Acharya.B.D., Are a/l polynomials arbitrarily graceful, proce.first south
east Asian Graph Theory Colloquium, Ed.Koh. K.M. and Yap. H.P,
Springer Verlag, New York (1984) 205 - 211.
[6). Acharya B.D. and Hegde S.M. Further results on k-sequential graphs
Nat. Acad. Sci. Lett., 8 (1995) 119 - 122.
[7). Acharya.B.D and Hegde. S. M. Set Sequential graphs, Nat
Acad.Scie.Lett 8 (1985) 387 - 390.
[8). Acharya. B.D and Hegde S.M, Arithmetic graphs, Jour. Graph theory,
14 (3) (1989) 275 - 299.
[9]. Acharya. B.D. and Hegde S.M. Strongly indexable graphs, Discrete
math, 93 (1990) 123 - 129.
[10]. Acharya. B.D. and Hegde S.M. On certain Valuations of graph,
Indian J.pure and applied maths. 227 (1991) 553 - 560.
[11]. Alon. N.and Scheinerman. E, Generalized sum graphs; Graphs and
Combi 8 (1952) 23 - 29.
ib2.
r:!i'G1ewlCel---------------------_::...--
[12}. Arumugam. S. and Germina. K. On Indexable graphs,
Discretemath. 161 (1996) 285 - 289.
[13]. Ayal. J. and Odite Favaron. Helms are graceful, Progress in Graph
Theory, Academic Press, Toronto, Ontario (1984) 89 - 92.
[14}. Baca.M. and Hollander. I. On (a,d) Antimagic prisms, Ars
Combinatoria 48 (1998) pp. 297 - 306.
[151. Baca. M., On magic Consecutive labelings for the speciaf classes of
plane graphs. Utilitas maths. 32 (1987) 59 - 65.
[16]. Baca. M. On Magic labelings of Mobius ladders. J. Franklin Inst. 326
(1989) 885 - 888.
[17]. Baca. M. On consecuUve labeJings of Plane graphs. J. Franklin
Inst.325 (1991) 249 - 253
[18]. Baca. M. J. Magic labelings of honey comb. Discrete Maths (1992)
305 - 311.
[19]. Baca. M. On Magic labelings of grid graphs. Ars Combiriatoria 33
(19'92) 295 - 299.
[20]. Baca. M. and Hollander, LabeJings of a certain class of convex
polytopes, J. Franklin Inst. 329 (1992) 539 - 547.
[21]. Balakrishnan. R. and Kumar. R. Existence and non existence of
Certain labeling for the graph K~V2K2 Utilitas math, 46 (1994) 97
102.
[22]. Balakrishnan. R., Selvam. A, Yegnanarayanan. V., On Felicitous
labeling of Graphs, Graph Theory and its applications, Proceedings
of the national workshop held at M.S. University Thirunelveli February
21 - 27, (1996) 47 - 61.
[23]. Bange. D.W, Baska skar. A. F. and Sla er. P.J., Sequentially
additive graphs, Discretemath.44 (1983) 235 - 241.
163
[24]. Beals. R, Gallian. J, Headly. P. and Jungries, Harmonious graphs:Jour. Combin Th, Series A. 56 (1991) 223 - 238.
[25]. Bermond J.C. Graceful graphs, radio Antennae and Frenchwindmills, Graph Theory and combinatorics, Pitman, London (1979)
13-37.
[26]. Bloom.G.S and Golomb.S.W. Applications of Undirected graphs,Proce. 1 EEE; 65 (1977) 562 - 570.
[27]. Bloom. G. S. and Golomb. S.W., Numbered complete graphs,Unusual rulers and assorted applications in Theory and Applications
of Graphs, Lecture notes in Maths; 642, Springer-verlag New York(1978) 53 - 65.
[28]. Bloom. G.S, A chronology of the Ringel - Kotzig conjecture and thecontinuing guest to call all tress are graceful Ann. N. Y. Acad. Sci. 326(1979).
[29]. Bodendick. R. and Walther. G., On (A,D) Antimagic parachutesl,Ars combin. 42 (1996) 129 -149.
[30]. Bodendick. R. and Walther. G., On (A,D) .Antimagic Parachutes II,Ars Combinatoria 46 (1997) pp. 33 - 63.
[31]. Bondy. J.A., and Murthy. U.S.R, Graph Theor; with applications,Macmillian Press, London (1977).
[32]. Barzin. M. and Ferravese. G, The subdivision graph of a gracefultree is a graceful tree, Discretemath, 181 (1998) 275 - 281.
[33]. Bhat Nayak and Deshmukh, New families of Graceful banana trees,proc. Indian Acad. Sci. Math.Sci.106 (1996) 201 - 216.
[34]. Bhat Nayak and Gokhale. S. K, Validity of Hebbare's conjecture,Utilitas Math. 29 (1986) 49 - 59.
[35]. Cahit. I, Elegant Valuation of the Paths, Ars Combini, 16 (1983) 223
227
[36]. Cahit. I, Cordial graph, a weaker version of graceful and harmonious
graphs, Ars Combi. 23 (1987) 201 -120.
164
0iGeje:wtU--------------------_!!...--
[37]. Cahit. I, On Cordial and 3-equitable labelings of graphs, utilitas Math,
37 (1990) 189 -198.
[38]. Cahit. I., Status of Graceful tree conjecture in 1989, in Topics in
combinatories and Graph Theory, R. Bodendick and R. Henn (eds),
Physica-Verlag, Heidelbrg, 1990.
[39]. Cahit. I., Recent results and open problems on cordial graphs,
Contemporary methods in Graph Theory, R. Bodendick (ed)
Wissenschaftsverlag, Mannheim, 1990,209 - 230.
[40]. Cahit. I. H-Cordial graphs, Bull. Inst. Combin. Appl., 18 (1996) 87
101.
[41]. Chang G.J. HSU. D. F. and Rogers. D.G. Additive variations on a
graceful theme. some results on harmonious and other related graphs
congress. Numer. 32 (1981) 181 -197.
[42]. Chen. Z. Z. A generalization of the Bodendick conjecture about
Graceful graphs. Topics in Combinatorics and Graph Theory R.
Bendendick and R. Henn, eds. physica-verlag, Heidelberg 1990, 737
-746.
[43]. Choudum. S. A. and Kishore S.P. M, All 5 -Stars are skolem
graceful, Indian. J. Pure and Appli. Math. 27 (1996) 1101 -1105.
[44]. Chung. F.R.K. and Hwang. F.K., Rotatable graceful graphs, Ars
combin.11 (1981)239-250.
[45]. David Kuo, Gerald J. Chary and Hariskwing, Cordiallabelings of
mKn Discretemaths 169 (1997) 121 - 131.
[46]. Delmore. C., Two sets of graceful graphs, jour. graph theory 4
(1980) 247 - 250.
[4f]. Delmore. C., Maheo. M, Thuillier; H, Koh,K.M ed Teo.H.K, Cycles
with a chord are graceful, J. graph Theory 4 (1980) 409 - 415.
165
[48]. Devaraj. J. On triangular graceful graphs; International Conference
on Graph Theory and its applications March 14-16, 2001, Anna
University Chennai.
[49]. Frucht. R, Graceful numbering of wheels and related graphs. Ann.
N.Y. Acad. of Sci., 319 (1979) 219 - 229.
[50]. Frucht. Rand Gallian. J.A., Labeling prisms, Ars Combin., 26 (1988)
69 -82.
[51]. Frucht. RW., and Salinas. L.C., Graceful numbering of graphs with
constraints on the first label, Ars Combin. 20 (1985) 143 - 157.
[52]. Fu. H.C. and Wa. S.L., New results on graceful graphs, J. combin. In
forsys. Sci., 15 (1990)170 -177.
[53]. Gallian. J.A., Labeling prisms and prism related graphs, Congress.
Numer., 59 (1989) 89 - 100. ./
[54]. Gallian. J.A., A survey : recent results, conjectures and open
problems on labeling graphs, J. Graph Theory, 13 (1984) 491 - 504.
[55]. Gallian, J.A., A guide to the graph labeling zoo, Discrete Appl.Math,
49 (1994) 213 - 229.
[56]. Gallian. J.A., A dynamic survey of Graph labeling, The electronic
journal of combinatorics 5 (1998) 1 - 52.
[57]. Gnanajothi. R8., Topics in Graph Theory, Ph.D. Thesis, Madurai
Kamaraj University (1991).
[58]. Germina. K.A., Studies in Graph Theory, Graceful, Harmonious,
strongly harmonious and Arithmetic graphs, Ph.D Thesis.
Manonmanium. Sundaranar University (1995).
[59]. Golomb. S.W., How to number a graph, in Graph Theory and
computing, RC. Read ed., Academic Press, New York (1972) 23 - 37.
166
~leJlC-et----------------------~~-
[60]. Grace. 1. On sequential labelings of graphs J. Graph Theory, 7
(1983) 195 - 201.
[61]. Graham. R.L. and Sloane. N.J.A., On additive bases and
harmonious graphs. SIAM.J.Alg. Discrete Math (1980) 382 - 404.
[62]. Hai-Jen Lee, Hsun-Ming Lee and J.Chang cordial labelings of
graphs Chinese J. mathematics (1992) Vol. 20. No.3, 263 - 273.
[63]. Harary. F., Graph Theory, Narosa Publishing House, New Delhi
(1993).
[64]. Harary. F., Sum Graphs and difference graphs congs. Numer. 72
(1990) 101 - 108.
[65]. Hertsfield. N. and Ringel. G., Pearls in Graph Theory, Academic
Press, San Diego, 1990.
[66]. Hegde. S.M., Additively graceful graphs, Nat-Acad, Sei. Lett. 12
(1989) 387 - 390.
[67]. Hegde. S.M., On K. sequential graphs, Nat-Acad. Sei. Lett., 16 (1993)
299 - 301.
[68]. Ho. y'S., Lee. S.M., Shee, S.E, Cordial labelings of the cartesion
product and composition of graphs, Ars Combin; 29 (1990) 169 - 180.
[69]. Hegde. C. and Kuiper. H., All wheels are graceful, Utilitas Math; 14
(1987) 311.
[70]. Hovey. M., A-cordial graphs Discrete Math, 93 (1991) 183 -194
[71]. Jinnah. M.A., and Suresh Singh. G.S., A note on Arithmetic
numbering of graphs, pro Symposium on Graphs and Combinatorics,
Kochi, Kerala, India (1991) 83 - 87.
[72]. Jungreis. D. and Reid. M., Labeling grids, Ars Combin. 34 (1992)
167-182.
167
[73]. Kathiresan.K.M, Consecutive labeling of two plane graphs. JAC.
Journal, 11,33 (1991).
[74]. Kathiresan.K.M, Subdivision of ladders are graceful. Indian.J.Pure
and applied math; 23 (1992) 21 - 23.
[75]. Ko-Wei. Lih, On Magic and consective labelings of plane graphs,
utilitas Math 24 (1983)165 - 197.
[76]. Koh. K.M. and Rogers. D.G., Lee. P.Y., and Toh. C.M., On graceful
graph: Union of graph with one vertex in common. Nanta Math, 12
(1979) 133 - 136.
[77]. Koh. K.M., Tan.T., and Rogers. D.G., Two theorems on graceful
trees, Discrete math, 25 (1979) 141 -148.
[78]. Koh-K.M, Rogers. D.G. and Tom. 1., Product of graceful trees,
Discrete math, 31 (1980) 279 - 292.
[79]. Koh. K.M., Rouses. D.G., Teo. H.K. and Yap. K.Y., Graceful Graphs.
Some further results and problems, Congress Numer. 29 (1980) 559
571.
[80]. Koh. K.M., and Yap. K.Y., Graceful numberings of cycles with a P3chord. Bull. Inst.math. Acd. Science 12 (1985) 41 - 48.
[81]. Kotzig. A and Rosa. A, Magic valuations of finite graphs, Canad
math. Bult. 13 (1970) 451 - 461.
[82]. Kotzig. A, Recent results and open problems in graceful graphs.Congr. Numer. 44 (1984) 197 - 219. /
[83]. Kuo. D., Chang. G.K., Wong. Y.H., Cordiallabelings of mKn, Discrete
Math. 169 (1997) 121 -131.
[84]. Lee. H.Y., Lee. H.M. and Chany. G.J., Cordiallabelings of graphs.
Chinese.J.math, 20 (1985) 85 - 96.
[85]. Lee. S.M., and Liu. A, A construction of cordial graphs from smaller
cordial graphs. Ars cambin. 32 (1991) 209 - 214.
168
~e/U!ItCA'/-------------------------~--
[86]. Lee. S.M., Schmeichel. E., and Shee., S.C., On felicitous graphs,Discrete math. 93 (1991) 201 - 209.
[87]. Lee. S.M., and Shee., On Skolem graceful graphs, Discrete math. 93
(1991) 195 - 200.
[88]. Liu. R.Y., On Bodendick's conjecture for graceful graphs, Chinese
Quart.J.math. 4 (1989) 67 - 73.
[89]. Liu. Y., The gracefulness of the Star with top sides J.sichuan Normal
Uni.V. 18 (1995) 52 -60.
[90]. Liu. B., and Zhang. X., On harmonious labelings of graphs, Ars.
Cambin, 36 (1993) 315 - 326.
[91]. Lo. S., On edge gracefullabelings of graphs, Congress. Numer. 50
(1985) 231 - 241.
[92]. Maheo. M., Strongly graceful graphs. Discrete Math 29 (1980) 39 -I
46.'
[93}. IVIaheo. M. and Thuillier. H., On graceful graphs, Ars. combin. 13
(1982) 181 - 192.
[94]. Mitchem. J. and Simoson. A., On edge- graceful and super-edgegraceful graphs. Ars cambin. 37 (1994) 97 -111.
[95]. Mollard. M., and Payan. C., Elegant labelings and edge colorings. A
proof of two conjectures of Hartman and chang. Hsu, Roger, Ars.
cambin. 36 (1993) 97 - 106.
[96]. Moultan. D., Gracefullabelings of triangular snakes. Ars Cambin. 28
(1989) 3 - 13.
[97]. Narasingh Deo, Graph Theory with applications to engineering andcomputer science, Prentice Hall of India, New Delhi (1990).
[98]. Punnim. Nand Pabhapote. N., On graceful graphs cycles with a PI\
chord, K 2 4, Ars. Combin. 23A (1987) 225 - 228.
169
[99]. Rosa. A., On Certain Valuations of the vertices of a graph. Theory of
graphs (International symposium, Rome, July 1966) Gordon and
Breach, N.Y. and Dunod paris (1967) 349 - 355.
[100]. Rosa. A. and Siran. J. Bipartite labelings of trees and the grace
size.J.Graph Theory, 19 (1995) 201 - 215.
(101]. Ringel. G., Problem 25 theory of graphs and its applications,
Proceedings of the symposium somolenice 1963 Prague. Pub\.
House of Czechoslovat academy of science (1964) 162.
[102]. Seoud. M., Abd el Maqsoud and Sheehan. J. Harmonious graphs.
Utilitas Math. 47 (198) 225 - 233.
(103]. Shee. S.E. On harmonious and related graphs, Ars. Combin. 23
(1987) A, 237 - 247.
(104]. Shee. S.C., Some results on A-valuation of graphs involving complete
bipartite graphs, Discrete Math 28 (1991) 73 - 80.
(105]. Shee. S.C. and Ho. y'S., The cardinality of one point union of n
copies of a graph. Discrets Math. 117 (1996) 221 - 229.
(106]. Shee. S. and Lee. S., On harmonious and felicitous labeling of
graphs. Congress. Number. 68 (1989) 155 -170.
(107]. Sheppard. D.A., The factorial representation of major balanced
labeled graphs. Discrete math. 15 (1976) 379 - 388.
(108]. Sin-Min - Lee and Andy Liu, A construction of k-graceful graphs from
complete bipartite graphs, SEA Bull. Math., Vol. 12. NO.1. (1988) 23
30.
[109]. Singh. G. S., A note on graceful prisms Nat. Acad. Sci. lett. 15 (1992)
193 - 154.
[110]. Singh. G.S., A note on sequential crowns. Nat.Acad. Sci. 16 (1993)
243 - 245.
170
[111]. Singh G.S., Subdivisfo are arithmetic Multidisciplinary
Research Review 2 Universityl) Kerala (1992) 23 - 25.
[112]. Singh. G.S., Some generalities on Arithmetic graphs. Graph Theory
Notes of New York, XXXVIII, 12-16 (2000) New York Academy of
Sciences.
[113]. Tom. A., Apostol, Introduction to Analytic Number theory, Springer
International student edition, Narosa Publishing House, (1980).
[114]. Slater. P.J. On k. sequential and other numbered graphs.
Discretemath. 34 (1981) 185 -193.
[115]. Slater. P. J., On k-graceful graphs, proc. of the 13 h S.E.conf. on
combinatorics, Graph theory and computing (1982) 53 - 57.
[116]. Slater. P. J. On k-Graceful, locally finite-graphs J.CombLTheory
series 8, (1983) 319 - 322.
[117]. Slater. P.J., Problems in Graph Theory, graceful and sequential
numberings of infinite graphs, South east Asian Bull, Math. 9 (1985)
15 - 25.
[118]. Slater P.J., On k-Graceful, Countably infinite graphs, Discrete math
61 (1956) 293 - 303.
[119]. Stewart. 8.M., Magic graphs, Canadian. J. math. 18 (1966) 1031
1059.
[120]. Steward. 8.M., Super Magic Complete graph, Canadian j.Math: 19
(1967) 427 - 438.
[121]. Suresh Singh. G., Ph.D. Thesis Kerala University. (1993).
[122]. Yilmaz. R. and Ca it. l. E., Cordial graphs, Ars Combin, 46 (1997)
251 - 266. G3J.h60
171