ON THE CROSSING NUMBER OF THE JOIN OF FIVE VERTEX GRAPH WITH THE DISCRETE GRAPH Dn

Acta Electrotechnica et Informatica

卷:17

Štefan BEREŽNݹ  Michal STAŠ¹ 

[1] Department of Mathematics and Theoretical Informatic, Faculty of Electrical Engineering and Informatics, Technical University of Kosice, Bozeny Nemcovej 32, 042 00 Kosice, Slovak Republic;

关键词: crossing number;    cyclic permutations;    drawing;    graph;    join;   

DOI  :  10.15546/aeei-2017-0023

来源: DOAJ

【 摘 要 】

In this paper, we show the values of crossing numbers for join products of graph G on five vertices with the discrete graph Dnand the path Pn on n vertices. The proof is done with the help of software. The software generates all cyclic permutations for a givennumber n. For cyclic permutations, P1 – Pm will create a graph in which to calculate the distances between all vertices of the graph.These distances are used in proof of crossing numbers of presented graphs.

【 授权许可】

Unknown