The crossing number of folded hypercubes

MaRDI QIDQ2811839zbMATH OpenFDO

Authors Haoli Wang, Yuansheng Yang, Yan Zhou, Wenping Zheng, Guoqing Wang

Publication date 10 June 2016

Published in Utilitas Mathematica (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1101.3386

zbMATH Keywords

crossing numberdrawingfolded hypercube

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Abstract: The {it crossing number} of a graph $G$ is the minimum number of pairwise intersections of edges in a drawing of $G$. The {it $n$-dimensional folded hypercube} $F{Q}_n$ is a graph obtained from $n$-dimensional hypercube by adding all complementary edges. In this paper, we obtain upper and lower bounds of the crossing number of $F{Q}_n$.

Recommendations

• An improved upper bound on the crossing number of the hypercube
• An improved upper bound on the crossing number of the hypercube.
• An upper bound for the crossing number of augmented cubes
• Bounds for the crossing number of the N‐cube
• The crossing number of locally twisted cubes \(L T Q_n\)

Cited in

(7)

• The crossing number of locally twisted cubes \(L T Q_n\)
• Strong Rabin numbers of folded hypercubes
• An upper bound for the crossing number of augmented cubes
• scientific article; zbMATH DE number 219248 (Why is no real title available?)
• A survey of graphs with known or bounded crossing numbers
• An improved upper bound on the crossing number of the hypercube.
• On crossing numbers of hypercubes and cube connected cycles

This page was built for publication: The crossing number of folded hypercubes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2811839)