Crossing Numbers of the Cartesian Product of the Double Triangular Snake Graphs With Path Pm.
Pathak Manojkumar Vijaynath, Nithya Sai Narayana · Journal Of Advanced Zoology · 2024
The crossing number Cr(G) of a graph G is the least number of edge crossings in all possible good drawings of G in the plane. Join and Cartesian products of graphs have many interesting graph-theoretical properties. In this paper, we evaluate the crossing number of the Cartesian product of double triangular snake graph DT2 with the path Pm. In this paper, we proved Cr(DT2 × Pm) = 6(m − 2), form ≥ 2 where Cr denotes the crossing number