Name
Abstract | ||
|---|---|---|
The crossing number of a graph G is the smallest number of pairwise crossings of edges among all the drawings of G in the plane. The pancake graph is an important network topological structure for interconnecting processors in parallel computers. In this paper, we prove the exact crossing number of pancake graph P-4 is six. |
Year | Venue | Keywords |
|---|---|---|
2017 | ARS COMBINATORIA | Crossing number,Drawing,Pancake graph |
DocType | Volume | ISSN |
Journal | 131 | 0381-7032 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yuansheng Yang | 1 | 80 | 24.02 |
| Bo Lv | 2 | 13 | 9.79 |
| Baigong Zheng | 3 | 0 | 0.34 |
| Xirong Xu | 4 | 44 | 13.81 |
| Ke Zhang | 5 | 7 | 6.11 |