The crossing number of P(N,3)

被引：56

作者：

Richter, RB ^{[1
]}

Salazar, G

机构：

[1] Univ Waterloo, Fac Math, Dept Combinator & Optimizat, Waterloo, ON N2L 3G1, Canada

[2] UASLP, IICO, San Luis Potosi 78210, SLP, Mexico

来源：

GRAPHS AND COMBINATORICS | 2002年 / 18卷 / 02期

关键词：

D O I：

10.1007/s003730200028

中图分类号：

O1 [数学];

学科分类号：

0701 [数学]; 070101 [基础数学];

摘要：

It is proved that the crossing number of each Generalized Petersen Graph P(3k + h) is k + h if h is an element of {0,2} and k + 3 if h = 1, for each k greater than or equal to 3, with the single exception of P(9, 3), whose crossing number is 2.

引用

页码：381 / 394

页数：14

共 11 条

[1]

THE CLASSIFICATION OF HAMILTONIAN GENERALIZED PETERSEN GRAPHS [J].

ALSPACH, B .

JOURNAL OF COMBINATORIAL THEORY SERIES B, 1983, 34 (03) :293-312

[2]

THE ISOPERIMETRIC NUMBER OF RANDOM REGULAR GRAPHS [J].

BOLLOBAS, B .

EUROPEAN JOURNAL OF COMBINATORICS, 1988, 9 (03) :241-244

[3]

CIMIKOWSKI R, 1998, IMPROVED BOUNDS CROS

[4]

THE CROSSING NUMBERS OF SOME GENERALIZED PETERSEN GRAPHS [J].

EXOO, G ;

HARARY, F ;

KABELL, J .

MATHEMATICA SCANDINAVICA, 1981, 48 (02) :184-188

[5]

Fiorini S., 1986, ANN DISCRETE MATH, V30, P225

[6]

Holton D. A., 1993, PETERSEN GRAPH

[7]

NEW LOWER BOUND TECHNIQUES FOR VLSI [J].

LEIGHTON, FT .

MATHEMATICAL SYSTEMS THEORY, 1984, 17 (01) :47-70

[8]

LEIGHTON FT, 1983, COMPLEXITY ISSUES VL

[9]

ON THE CROSSING NUMBERS OF CERTAIN GENERALIZED PETERSEN GRAPHS [J].

MCQUILLAN, D ;

RICHTER, RB .

DISCRETE MATHEMATICS, 1992, 104 (03) :311-320

[10]

SALAZAR G, 1997, THESIS CARLETON U OT

← 1 2 →