Volume 67 | Issue 3 | Year 2021 | Article Id. IJMTT-V67I3P512 | DOI : https://doi.org/10.14445/22315373/IJMTT-V67I3P512
Extending the idea of rooted product of two graphs, a new operation on two graphs is introduced and some of its properties are studied. We call it k-rooted product and denote it as 𝐺∘𝑘𝐻, where k-copies of a rooted graph H are connected at the root to every vertex of the graph G in the resulting product graph.
[1] Bonday J.A., U.S.R Murthy, Graph theory with applications, Macmillan press, London,(1976).
[2] Berge C, Graphs and Hyper graphs. North-Holland, Amsterdam(1973).
[3] Bresar B., Klavzar S, Rall D F, Dominating direct product graphs, Discrete Mathematics 307(2007) 1636-1642.
[4] Godsil C D, Mckay B D, A New graph product and its spectrum, Bulletin of the Australasian Mathematical Society 18(1)(1978) 21-28.
[5] Ore O, Theory of Graphs, Amer.Maths. Soc.Colloq.Pub.,38(1962).
[6] W. Imrich, S. Klavzar, Product graphs : Structure and recognition, Wiley,(2000).
Rashmi S B, Indrani Pramod Kelkar, "k-Rooted Product of Two Graphs," International Journal of Mathematics Trends and Technology (IJMTT), vol. 67, no. 3, pp. 99-103, 2021. Crossref, https://doi.org/10.14445/22315373/IJMTT-V67I3P512