The crossing number of locally twisted cubes \(L T Q_n\)
From MaRDI portal
Publication:1671371
DOI10.1016/j.dam.2018.03.070zbMath1394.05082OpenAlexW2964339701MaRDI QIDQ1671371
Zhang Huifeng, Xu Xirong, Zhao Lingqi, Bai Siqin, 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
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (2)
The generalized 4-connectivity of locally twisted cubes ⋮ Communication Performance Evaluation of the Locally Twisted Cube
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fault-tolerant edge-pancyclicity of locally twisted cubes
- On crossing numbers of hypercubes and cube connected cycles
- A framework for solving VLSI graph layout problems
- Node-pancyclicity and edge-pancyclicity of hypercube variants
- Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
- On the crossing numbers of \(K_m\square C_n\) and \(K_{m,l}\square P_n\)
- On the crossing number of \(K_{ m } \square P_{n}\)
- The crossing number of \(K_{2,m}\square P_n\)
- Constructing edge-disjoint spanning trees in locally twisted cubes
- The crossing numbers of generalized Petersen graphs with small order
- Some provably hard crossing number problems
- Intersections of curve systems and the crossing number of \(C_ 5\times C_ 5\)
- New bounds on crossing numbers
- The crossing number of \(C(n; \{1,3\})\)
- The \(k\) most frequent distances in the plane
- Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults
- Panconnectivity of locally twisted cubes
- A lower bound for crossing numbers of graphs with application to \(K_n\),\(K_{pq}\)g, and \(Q(d)\)
- On the crossing numbers of loop networks and generalized Petersen graphs
- The crossing number of folded hypercubes
- The crossing number of the generalized Petersen graphP(10, 3) is six
- An upper bound for the crossing number of augmented cubes
- Crossing Number is NP-Complete
- An improved upper bound on the crossing number of the hypercube
- New lower bound techniques for VLSI
- The crossing number of c4 × c4
- Crossing Numbers and Hard Erdős Problems in Discrete Geometry
- On the Number of Incidences Between Points and Curves
- The locally twisted cubes
- Augmented cubes
- The crossing number of K11 is 100
- Toward a theory of crossing numbers
- Crossing Number Problems
- Bounds for the crossing number of the N‐cube
- On a problem of P. Turan concerning graphs
- Distinct distances in the plane
This page was built for publication: The crossing number of locally twisted cubes \(L T Q_n\)