The crossing number of locally twisted cubes L T Q_n

DOI10.1016/J.DAM.2018.03.070zbMATH Open1394.05082OpenAlexW2964339701MaRDI QIDQ1671371FDOQ1671371

Authors: Zhao Lingqi, Xu Xirong, Bai Siqin, Zhang Huifeng, Yuansheng Yang 

Publication date: 6 September 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2018.03.070

Recommendations

• An upper bound for the crossing number of locally twisted cubes.
• On Eggleton and Guy's conjectured upper bound for the crossing number of the \(n\)-cube
• scientific article; zbMATH DE number 1735732
• Bounds for the crossing number of the N‐cube
• An improved upper bound on the crossing number of the hypercube

zbMATH Keywords

interconnection networkcrossing numberdrawinglocally twisted cube

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Additive combinatorics
• Title not available (Why is that?)
• Constructing edge-disjoint spanning trees in locally twisted cubes
• Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults
• Panconnectivity of locally twisted cubes
• Crossing Numbers and Hard Erdős Problems in Discrete Geometry
• On the Number of Incidences Between Points and Curves
• The locally twisted cubes
• Fault-tolerant edge-pancyclicity of locally twisted cubes
• Node-pancyclicity and edge-pancyclicity of hypercube variants
• Crossing Number is NP-Complete
• The crossing number of \(C(n; \{1,3\})\)
• On the crossing numbers of loop networks and generalized Petersen graphs
• A framework for solving VLSI graph layout problems
• Augmented cubes
• New lower bound techniques for VLSI
• On a problem of P. Turan concerning graphs
• The crossing number of c₄ × c₄
• Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
• Crossing Number Problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Distinct distances in the plane
• The crossing number of K₁₁ is 100
• Some provably hard crossing number problems
• On the crossing numbers of \(K_m\square C_n\) and \(K_{m,l}\square P_n\)
• Toward a theory of crossing numbers
• Title not available (Why is that?)
• New bounds on crossing numbers
• On crossing numbers of hypercubes and cube connected cycles
• An improved upper bound on the crossing number of the hypercube
• A lower bound for crossing numbers of graphs with application to \(K_n\),\(K_{pq}\)g, and \(Q(d)\)
• The crossing number of folded hypercubes
• Bounds for the crossing number of the N‐cube
• Title not available (Why is that?)
• Intersections of curve systems and the crossing number of \(C_ 5\times C_ 5\)
• The crossing number of \(K_{2,m}\square P_n\)
• The \(k\) most frequent distances in the plane
• On the crossing number of \(K_{ m } \square P_{n}\)
• The crossing numbers of generalized Petersen graphs with small order
• On Eggleton and Guy's conjectured upper bound for the crossing number of the \(n\)-cube
• The crossing number of the generalized Petersen graph \(P(10, 3)\) is six
• An upper bound for the crossing number of augmented cubes

Cited In (9)

• The generalized 4-connectivity of locally twisted cubes
• Bounds for the crossing number of the N‐cube
• Title not available (Why is that?)
• The crossing number of folded hypercubes
• Disproof of a conjecture by Erdős and Guy on the crossing number of hypercubes
• Title not available (Why is that?)
• An upper bound for the crossing number of locally twisted cubes.
• Communication Performance Evaluation of the Locally Twisted Cube
• An upper bound for the crossing number of augmented cubes

This page was built for publication: The crossing number of locally twisted cubes \(L T Q_n\)

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