On the crossing number for Kronecker product of a tripartite graph with path

On the crossing number for Kronecker product of a tripartite graph with path

The crossing number of a graph G, Cr(G) is the minimum number of edge crossings overall good drawings of G. Among the well-known four standard graph products namely Cartesian product, Kronecker product, strong product and lexicographic product, the one that is most difficult to deal with is the Kron...

Full description

Bibliographic Details
Main Authors: N. Shanthini, J. Baskar Babujee
Format: Article
Language:English
Published: Taylor & Francis Group 2020-09-01
Series:AKCE International Journal of Graphs and Combinatorics
Subjects:
drawing
crossing number
kronecker product
path
rectilinear crossing number
Online Access:http://dx.doi.org/10.1016/j.akcej.2019.08.004

Internet

http://dx.doi.org/10.1016/j.akcej.2019.08.004

Similar Items