Edge exchanges in Hamiltonian decompositions of Kronecker-product graphs

Computers and Mathematics with Applications

Volumn 31, Issue 2, 1996, Pages 11-19

  Jha, P K ^a   Agnihotri, N ^a,b   Kumar, R ^a,c  

^a NETAJI SUBHAS INSTITUTE OF TECHNOLOGY   (India)

^b University of Georgia   (United States)

^c Centre for Development of Telematics India   (India)

Author keywords

Alternate four cycle; Edge exchange; Hamiltonian decomposition; Kronecker product

Indexed keywords

COMPUTATION THEORY; COMPUTER NETWORKS; FAULT TOLERANT COMPUTER SYSTEMS; SYSTEMS ANALYSIS;

ALTERNATE FOUR CYCLE; EDGE EXCHANGE; HAMILTONIAN DECOMPOSITION; KRONECKER PRODUCT;

GRAPH THEORY;

EID: 0029732171     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/0898-1221(95)00189-1     Document Type: Article

References (23)

1. Z. Barayani and G.-R. -, Hamiltonian decomposition of lexicographic product, J. Combin. Theory, Ser. B 31. 253-261 (1981).
2. B. Alspach, J.-C. Bermond and D. Sotteau, Decompositions into cycles I: Hamilton decompositions, In Cycles and Rays, (Edited by G. Hahn et al.), pp. 9-18. Kluwer Academic, The Netherlands, (1990).
3. J. Bosak, Decompositions of Graphs. Kluwer Academic, Dordrecht, (1991).
4. M. Zhou. Decompositions of some product graphs into 1-factors and Hamiltonian cycles, Ars Combin. 28, 258-268 (1989)
5. J.-C. Bermond, O. Favaron and M. Maheo. Hamiltonian decomposition of Caley graphs of degree four, J. Combin. Theory. Ser. B 46, 142-153 (1989)
6. C.C. Lindner and C.A. Rodger. Decompositions into cycles II: Cycle systems, In Contemporary Design Theory. (Edited by J.H. Dinitz and D.R. Stinson), pp. 325-369, John Wiley & Sons, (1992).
7. D.J. Miller, The categorical product of graphs, Canad. J. Math 20, 1511-1521 (1968).
8. M.F. Capobianco. On characterizing tensor-composite graphs, Annals NY Acad. Sci. 175, 80-84 (1970).
9. J.-C. Bermond. Hamiltonian decompositions of graphs, digraphs and hypergraphs, Annals Discrete Math 3, 21-28 (1978).
10. M. Farzan and D.A. Waller. Kronecker products and local joins of graphs, Canad. J. Math 29, 255-269 (1977).
11. P. Hell, An introduction to the category of graphs, Annals NY Acad. Sci. 328, 120-136 (1979).
12. R.H. Lamprey and B.H. Barnes, Product graphs and their applications, Modeling and Simulation 5, 1119-1123 (1974); Proc. Fifth Annual Pittsburgh Conference, Instrument Society of America, Pittsburgh, PA, (1974).
13. R.H. Lamprey and B.H. Barnes, Product graphs and their applications, Modeling and Simulation 5, 1119-1123 (1974); Proc. Fifth Annual Pittsburgh Conference, Instrument Society of America, Pittsburgh, PA, (1974).
14. J. Nesetril, Representations of graphs by means of products and their complexity, Lecture Notes in Computer Science 118, 94-102 (1981).
15. P.M. Weichsel. The Kronecker product of graphs. Proc. Am. Math. Soc. 13, 47-52 (1962).
16. P.K. Jha, Hamiltonian decompositions of products of cycles, Indian J. Pure Appl. Math. 23, 723-729 (1992).
17. E. Cohen and M. Tarski, NP-completeness of graph decomposition problems, J. Complexity 7, 200-212 (1991).
18. F. Harary, Graph Theory, Addison-Wesley, (1969).
19. S.T. Hedetniemi, Homomorphisms of graphs and automata, Tech. Report 03105-44-T, University of Michigan, Ann Arbor, MI, (1966).
20. A.P. Sprague, Edge exchanges on Hamiltonian cycles in interval graphs, Congr. Numer. 85, 111-122 (1991).
21. P.K. Jha, Decompositions of the Kronecker product of a cycle and a path into long cycles and long paths, Indian J. Pure Appl. Math. 23, 585-602 (1992).
22. S.-R. Kim, Centers of a tensor-composite graph, Congr. Numer. 81, 193-204 (1991).
23. S. Klavžar and M. Petkovsek, Graphs with non-empty intersection of longest paths, Ars Combin. 29, 43-52 (1990).