Join Products K2,3Cn+

Mathematics

Michal Staš¹ 

[1] Faculty of Electrical Engineering and Informatics, Technical University of Košice, 042 00 Košice, Slovakia;

关键词: graph;    join product;    crossing number;    cyclic permutation;    arithmetic mean;   

DOI  :  10.3390/math8060925

来源: DOAJ

【 摘 要 】

The crossing number $\mathrm{cr}\left(G\right)$ of a graph G is the minimum number of edge crossings over all drawings of G in the plane. The main goal of the paper is to state the crossing number of the join product $K_{2,3}+C_n$ for the complete bipartite graph $K_{2,3}$ , where $C_n$ is the cycle on n vertices. In the proofs, the idea of a minimum number of crossings between two distinct configurations in the various forms of arithmetic means will be extended. Finally, adding one more edge to the graph $K_{2,3}$ , we also offer the crossing number of the join product of one other graph with the cycle $C_n$ .

【 授权许可】

Unknown