id: 06096693
dt: j
an: 06096693
au: Rajan, Bharati; Rajasingh, Indra; Beulah, P.Vasanthi
ti: On the crossing number of honeycomb related networks.
so: J. Comb. Math. Comb. Comput. 79, 129-137 (2011).
py: 2011
pu: Charles Babbage Research Centre, Winnipeg
la: EN
cc: 
ut: crossing number; honeycomb related networks; honeycomb rectangular torus;
    honeycomb rhombic torus
ci: 
li: 
ab: Summary: The crossing number of a graph $G$ is the minimum number of
    crossings of its edges among the drawings of $G$ in the plane and is
    denoted by $cr(G)$. In this paper we obtain bounds for the crossing
    number for two different honeycomb tori namely, the honeycomb
    rectangular torus and the honeycomb rhombic torus which are obtained by
    adding wraparound edges to honeycomb meshes.
rv: