2- Cartesian Product of Special Graphs

Untitled

“…The tensor product GH  of two graphs G and H is very well-known and studied in detail ([1], [2], [3], [4]). This concept has been extended by introducing 2  tensor product 2 GH  of G and H and studied for special graphs [5]. In this paper, we discuss connectedness of 2 GH  for any connected graphs G and H .…”

“…

The tensor product GH  of two graphs G and H is well-known graph product and studied in detail in the literature. This concept has been generalized by introducing 2-tensor product 2 GH  and it has been discussed for special graphs like n P and n C [5]. In this paper, we discuss 2 GH  , where G and H are connected graphs.

…”

Connected and Distance in G ⊗2 H

“…of G and H and studied for special graphs [5]. In this paper, we discuss connectedness of 2 GH  for any connected graphs G and H .…”

Adjacency Matrix of Product of Graphs

“…In this direction, we have defined 2−cartesian product G × 2 H and 2−tensor product G ⊗ 2 H of graphs G and H ( [1], [2], [3]). …”

“…Definition 1.5 [3] Let G = (U, E 1 ) and H = (V, E 2 ) be two connected graphs. The 2−cartesian product G × 2 H of G and H is the graph with vertex set U × V and two vertices (u, v) and…”