Vol. 7 No. 1 (2023): Vol 7, Iss 1, Year 2023
Articles

On the Crossing numbers of T Sn × Pm and T Sn × Cm

Pathak Manojkumar Vijaynath
VPM’S Kannada high school and Junior college, Mithaghar road, Mulund(E), Mumbai-81.
Nithya Sai Narayana
Department of Mathematics, University of Mumbai, Vidyanagari Kalina Santacruz East Mumbai-400098
Published June 30, 2023
Keywords
  • Crossing number, Cartesian product of graphs, Join of graphs, Double Triangular snake graph, path, cycl
How to Cite
Pathak Manojkumar Vijaynath, & Nithya Sai Narayana. (2023). On the Crossing numbers of T Sn × Pm and T Sn × Cm. Journal of Computational Mathematica, 7(1), 001-005. https://doi.org/10.26524/cm157

Abstract

The crossing numbers of graphs is the least number of edge crossings in all possible good drawings of graph G. Crossing number of graphs has many applications in day today life such as road and railways crossings, Networking, VLSI circuit development etc. Cartesian product and Join product of graph has received maximum attention in many research problems. In this paper we proved Screenshot_2023-12-05_114749.png for m ≥ 3 using the results proved in [6].

Downloads

Download data is not yet available.