Independence in direct-product graphs

Ars Combinatoria

Volumn 50, Issue , 1998, Pages 53-63

  Jha, Pranava K ^a   Klavžar, Sandi ^b  

^a NETAJI SUBHAS INSTITUTE OF TECHNOLOGY   (India)

^b UNIVERSITY OF MARIBOR   (Slovenia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032438161     PISSN: 03817032     EISSN: 28175204     Source Type: Journal    
DOI: None     Document Type: Article

References (20)

1. M. O. Albertson, L. Chan and R. Haas. Independence and graph homomorphisms, J. Graph Theory 17 (1993) 581-588.
2. S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy, Proof verification and hardness of approximation problems, in Proc. 33rd IEEE Symp. on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, 1992, 14-23.
3. R. Boppana and M. M. Halldorsson, Approximating maximum independent sets by excluding subgraphs, BIT 32 (1992) 180-196.
4. D. Duffus, B. Sands and R.E. Woodrow, On the chromatic number of the product of graphs, J. Graph Theory 9 (1985) 487-495.
5. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP - Completeness, W H Freeman & Co, 1979.
6. D. Greenwell and L. Lovász, Applications of product colourings, Acta Math. Acad. Sci. Hungar. 25 (1974) 335-340.
7. J. Hagauer and S. Klavžar, On independence numbers of the Cartesian products of graphs, Ars Combin., to appear.
8. F. Harary, Graph Theory, Addison-Wesley, 1969.
9. S. T. Hedetniemi, Homomorphisms of graphs and automata, Tech. Report 03105-44-T, University Michigan, Ann Arbor, MI, 1966.
10. 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 (1992) 585-602.
11. P. K. Jha, Hamiltonian decompositions of products of cycles, Indian J. Pure Appl. Math. 23 (1992) 723-729.
12. P. K. Jha, S Klavžar and B Zmazek, Isomorphic components of Kronecker product of bipartite graphs, Preprint Ser. Univ. Ljubljana 32 (1994) no. 452.
13. P. K. Jha and G. Slutzki, Independence numbers of product graphs, Appl. Math. Lett. 7(4) (1994) 91-94.
14. S. Klavžar, Coloring graph products - a survey, Discrete Math., in press.
15. R. H. Lamprey and B. H. Barnes, Product graphs and their applications, Modelling and Simulation, 5 (1974) 1119-1123 (Proc Fifth Annual Pittsburgh Conference, Instrument Society of America, Pittsburgh, PA, 1974).
16. F. Lazebnik, V. A. Ustimenko and A. J. Woldar, A new series of dense graphs of high girth, Rutcor Research Report 33-93, Rutgers University, NJ, Dec 1993.
17. J. A. McHugh, Algorithmic Graph Theory, Prentice-Hall, 1990.
18. R. J. Nowakowski and D. Rall, Associative graph products and their independence, domination and coloring numbers, manuscript, June 1993.
19. E. Sonnemann and O. Kraft, Independence numbers of product graphs, J. Combin. Theory Ser. B 17 (1974) 133-142.
20. P. M. Weichsel, The Kronecker product of graphs, Proc. Amer. Math. Soc. 13 (1962) 47-52.