Operations Research Transactions
• Original Articles • Previous Articles Next Articles
YUAN Zi-Han- Huang-Yuan-Qiu
Received:
Revised:
Online:
Published:
Contact:
Abstract: The crossing Number of Petersen graph $P(m,1)$ with paths $P_n$ is NP-complete problem, Y.H. Peng and Y.C.Yiew have determined the crossing Number of $P(3,1)$ with paths $P_n$ is $4n$, we have proved the crossing Number of $P(4,1)$ with paths $P_n$ is $8n$.
Key words: crossing number, petersen graph P(4,1), paths, Cartesian product
YUAN Zi-Han- Huang-Yuan-Qiu. The crossing Number of Petersen graph P(4,1) with paths Pn[J]. Operations Research Transactions.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: https://www.ort.shu.edu.cn/EN/
https://www.ort.shu.edu.cn/EN/Y2011/V15/I3/95
