THE CROSSING NUMBERS OF JOIN PRODUCTS OF PATHS WITH THREE GRAPHS OF ORDER FIVE

被引：4
|
作者：
Stas, Michal [1 ]
Svecova, Maria [1 ]
机构：
[1] Tech Univ Kosice, Fac Elect Engn & Informat, Dept Math & Theoret Informat, Kosice 04200, Slovakia
来源：
OPUSCULA MATHEMATICA | 2022年 / 42卷 / 04期
关键词：
graph; crossing number; join product; cyclic permutation; path; 2 SYMMETRIC GRAPHS; CARTESIAN PRODUCTS; DISCRETE GRAPH;
D O I：
10.7494/OpMath.2022.42.4.635
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The main aim of this paper is to give the crossing number of the join product G* + P-n for the disconnected graph G* of order five consisting of the complete graph K-4 and one isolated vertex, where P-n is the path on n vertices. The proofs are done with the help of a lot of well-known exact values for the crossing numbers of the join products of subgraphs of the graph G* with the paths. Finally, by adding new edges to the graph G*, we are able to obtain the crossing numbers of the join products of two other graphs with the path P-n.
引用
收藏
页码：635 / 651
页数：17
相关论文
共 50 条
12345