The Crossing Number of Join Product of kth Power of Path Pm with Isolated Vertices and Path Pn

Sun Yuan Hsieh, Cheng Chian Lin

研究成果: Conference contribution

1 引文 斯高帕斯(Scopus)

摘要

A graph G is said to have a crossing if two edges of G share an interior point. The minimum crossing number of G is denoted by cr(G). The crossing number problem is to find the minimum crossing solution of a graph, and it can be used in applications of circuit layout. Although the crossing numbers of join product graphs have been extensively studied, the crossing number of join product of power graphs with path is relatively unexplored. Let Pm and Pn be paths with m and n vertices, and Dn be a graph consisting of n isolated vertices. In this paper, we investigate the crossing number of kth power of path Pm that joins with isolated vertices Dn and path Pn. We have proved the minimum crossing numbers of Pk m+Dn for m ≤ 6, n ≥ 1, and Pk m+Pn for m ≤ 6, n ≥ 2.

原文English
主出版物標題Proceedings - 2016 International Computer Symposium, ICS 2016
發行者Institute of Electrical and Electronics Engineers Inc.
頁面62-67
頁數6
ISBN(電子)9781509034383
DOIs
出版狀態Published - 2017 二月 16
事件2016 International Computer Symposium, ICS 2016 - Chiayi, Taiwan
持續時間: 2016 十二月 152016 十二月 17

出版系列

名字Proceedings - 2016 International Computer Symposium, ICS 2016

Other

Other2016 International Computer Symposium, ICS 2016
國家Taiwan
城市Chiayi
期間16-12-1516-12-17

All Science Journal Classification (ASJC) codes

  • Computer Vision and Pattern Recognition
  • Hardware and Architecture
  • Computer Networks and Communications
  • Computer Science Applications

指紋 深入研究「The Crossing Number of Join Product of kth Power of Path P<sub>m</sub> with Isolated Vertices and Path P<sub>n</sub>」主題。共同形成了獨特的指紋。

引用此