ON THE CROSSING NUMBER OF THE JOIN OF THE WHEEL ON FIVE VERTICES WITH THE DISCRETE GRAPH

被引：7

作者：

Stas, Michal ^{[1
]}

机构：

[1] Tech Univ Kosice, Fac Elect Engn & Informat, Dept Math & Theoret Informat, Letna 9, Kosice 04200, Slovakia

来源：

BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY | 2020年 / 101卷 / 03期

关键词：

graph; drawing; crossing number; join product; rotation;

D O I：

10.1017/S0004972719001199

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We give the crossing number of the join product W-4+D-n, where W-4 is the wheel on five vertices and D-n consists of n isolated vertices. The proof is based on calculating the minimum number of crossings between two different subgraphs from the set of subgraphs which do not cross the edges of the graph W-4 and from the set of subgraphs which cross the edges of W-4 exactly once.

引用

页码：353 / 361

页数：9

共 23 条

[1] Berezny S., 2017, ACTA ELECTROTECHNICA, V17, P27
[2] Berezny S., 2018, ACTA ELECTROTECHNICA, V18, P3, DOI DOI 10.15546/AEEI-2018-0001
[3] Berezny S, 2018, CARPATHIAN J MATH, V34, P143
[4] Chimani M., 2019, 24 EUR S ALG ESA 201
[5] Clancy K., 2019, ARXIV190105155
[6] Drazenska E., 2019, PROC CJS 2019 22TH C, P41
[7] He P., 2007, J ZHENGZHOU U NAT SC, V39, P14
[8] Hernández-Vélez C, 2014, ELECTRON J COMB, V21
[9] Kleitman D. J., 1970, Journal of Combinatorial Theory, Series A, V9, P315, DOI 10.1016/S0021-9800(70)80087-4
[10] Klesc Marian, 2012, Mathematical Modeling and Computational Science. International Conference, MMCP 2011. Revised Selected Papers, P160, DOI 10.1007/978-3-642-28212-6_15

← 1 2 3 →