(a, d)-Edge-antimagic total labelings of caterpillars

Lecture Notes in Computer Science

Volumn 3330, Issue , 2005, Pages 169-180

  Sugeng, K A ^a   Miller, M ^a   Slamin, ^b   Baca M ^c  

^a UNIVERSITY OF BALLARAT   (Australia)

^b UNIVERSITY OF JEMBER   (Indonesia)

^c TECHNICAL UNIVERSITY OF KO ICE   (Slovakia)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL GEOMETRY; GRAPH THEORY; REGRESSION ANALYSIS;

ARITHMETIC PROGRESSION; EDGE-ANTIMAGIC;

EDGE DETECTION;

EID: 23944455332     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30540-8_19     Document Type: Conference Paper

References (13)

1. B.D. Acharya and S.M. Hegde, Strongly indexable graphs,Discrete Math. vol 93 (1991), 275-299.
2. M. Bača, Y. Lin, M. Miller and R. Simanjuntak, New constructions of magic and antimagic graph labelings, Utilitas Math., vol 60 (2001), 229-239.
3. M. Bača, Y. Lin, M. Miller and M.Z. Youssef, Edge-antimagic graphs, Discrete Math., to appear.
4. R. Bodendiek and G. Walther, On (a,d)-antimagic parachutes, Ars Combin., vol 42 (1996), 129-149.
5. R. Bodendiek and G. Walther, (a,d)-antimagic parachutes II, Ars Combin., vol 46 (1997), 33-63.
6. H. Enomoto, A.S. Lladó, T. Nakamigawa and G. Ringel, Super edge-magic graphs, SUT J. Math., vol 34 (1998), 105-109.
7. N. Hartsfield and G. Ringel, Pearls in Graph Theory, Academic Press, Boston -San Diego - New York - London, 1990.
8. S.M. Hegde, Numbered graphs and their applications, Ph.D Thesis, Delhi University, 1989.
9. S.M. Hegde, On indexable graphs, J. Combinatorics, Information and System Sciences, vol 17 (3-4) (1992), 316-331
10. A. Kotzig and A. Rosa, Magic valuations of finite graphs Canad. Math. Bull., vol 13 (1970), 451-461.
11. A. Kotzig and A. Rosa, Magic valuations of complete graphs, Publ. CRM, vol 175 (1972).
12. W.D. Wallis, Magic Graphs, Birkhäuser, Boston - Basel - Berlin (2001).
13. D.B. West, An Introduction to Graph Theory, Prentice-Hall (1996)