Some Results On Kronecker Product Of Two Graphs

International Journal of Mathematical Trends and Technology (IJMTT)          
© 2012 by IJMTT Journal
Volume-3 Issue-1                           
Year of Publication : 2012
Authors : Dr.P.Bhaskarudu


Dr.P.Bhaskarudu "Some Results On Kronecker Product Of Two Graphs"International Journal of Mathematical Trends and Technology (IJMTT),V3(1):34-37.June 2012. Published by Seventh Sense Research Group.

We consider product graphs and recall the results associated to the product graphs. Paul M.Weichsel [3] defined the Kronecker product of graphs. He has proved a characterization for the product graphs to be connected graphs. He also obtained “If G1 and G2 are connected graphs with no odd cycles then has exactly two connected components.” E Sampath Kumar [2] has proved that for a connected graph & with no odd cycles G1 (K)G2  2G .


[1] Bondy, J.A., and Murty, US. Graph theory with Applications, Macmillan, London (1976).
[2] Sampathkumar, E. On tensor product graphs, J. Austraial, Math. Soc. 20 (series A) (1975), pp 268- 273.
[3] Weichsel, P.M. The kronecker product of Graphs, Proc. Am. Math. Soc. 13(1962), pp 47-52.

Kronecker product of graphs, connected graphs, odd cycles, degree, regular graphs, bipartite graph.