Some Results On Kronecker Product Of Two Graphs

Dr.P.Bhaskarudu

doi:https://doi.org/10.14445/22315373/IJMTT-V3I1P506

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 3 | Issue 1 | Year 2012 | Article Id. IJMTT-V3I1P506 | DOI : https://doi.org/10.14445/22315373/IJMTT-V3I1P506

Some Results On Kronecker Product Of Two Graphs

Dr.P.Bhaskarudu

Abstract

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 .

Keywords

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

References

[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.

Citation :

Dr.P.Bhaskarudu, "Some Results On Kronecker Product Of Two Graphs," International Journal of Mathematics Trends and Technology (IJMTT), vol. 3, no. 1, pp. 34-37, 2012. Crossref, https://doi.org/10.14445/22315373/IJMTT-V3I1P506