The crossing number of locally twisted cubes LTQ^sub n

The crossing number oi a graph G is the minimum number of pairwise intersections of edges in a drawing of G. Motivated by the recent work (Faria et al., 2008) which solves the upper bound conjecture on the crossing number of n-dimensional hypercube proposed by Erdos and Guy, we consider the crossing...

Full description

Saved in:
Bibliographic Details
Published in:Discrete Applied Mathematics 2018-10, Vol.247, p.407
Main Authors: Lingqi, Zhao, Xirong, Xu, Siqin, Bai, Huifeng, Zhang, Yuansheng, Yang
Format: Article
Language:English
Subjects:
Algorithms
Cubes
Graph theory
Graphs
Hypercubes
Intersections
Mathematics
Statistical data
Upper bounds
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The crossing number oi a graph G is the minimum number of pairwise intersections of edges in a drawing of G. Motivated by the recent work (Faria et al., 2008) which solves the upper bound conjecture on the crossing number of n-dimensional hypercube proposed by Erdos and Guy, we consider the crossing number of locally twisted cubes LTQn, which is one of important variation of the hypercube Qn. In this paper, we obtain the upper bound of the crossing number of LTQn as follows. (ProQuest: ... denotes formulae omitted.)
ISSN:0166-218X
1872-6771