Open AccessThe crossing number of join of the generalized Petersen graph P(3,1) with path and cycle
Author(s) -
Yuanqiu Huang,
Zhangdong Ouyang,
Jing Wang
Publication year - 2017
Publication title -
discussiones mathematicae graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.476
H-Index - 19
eISSN - 2083-5892
pISSN - 1234-3099
DOI - 10.7151/dmgt.2005
Subject(s) - mathematics , join (topology) , combinatorics , path (computing) , graph , crossing number (knot theory) , discrete mathematics , computer science , geography , intersection (aeronautics) , cartography , programming language
There are only few results concerning the crossing numbers of join of some graphs. In this paper, the crossing numbers of join products for the generalized Petersen graph P(3, 1) with n isolated vertices as well as with the path Pn on n vertices and with the cycle Cn are determined.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom