Software Solution of the Algorithm of the Cyclic-Order Graph

In this paper we describe by pseudo-code the ``Algorithm of the cyclic-order graph'', which we programmed in MATLAB 2016a and which is also possible to be executed in GNU Octave. We describe program's functionality and its use. The program implementing this algorithm is an indispensa...

Full description

Bibliographic Details
Main Authors: Štefan Berežný, Ján Buša, Jr., Michal Staš
Format: Article
Language:English
Published: Technical University of Kosice 2018-03-01
Series:Acta Electrotechnica et Informatica
Subjects:
Online Access:http://www.aei.tuke.sk/papers/2018/1/01_Berezny.pdf
id doaj-7d1ca1059a3b4069bed07ec871f87dea
record_format Article
spelling doaj-7d1ca1059a3b4069bed07ec871f87dea2020-11-24T23:22:35ZengTechnical University of Kosice Acta Electrotechnica et Informatica1335-82431338-39572018-03-0118131010.15546/aeei-2018-0001Software Solution of the Algorithm of the Cyclic-Order GraphŠtefan Berežný0Ján Buša, Jr.1Michal Staš2Department of Mathematics and Theoretical Informatics, Faculty of Electrical Engineering and Informatics, Technical University of Košice, Nemcovej 32, 042 00 Košice, Slovak RepublicLIT, Joint Institute for Nuclear Research, 141980 Dubna, Moscow Region, RussiaDepartment of Mathematics and Theoretical Informatics, Faculty of Electrical Engineering and Informatics, Technical University of Košice, Nemcovej 32, 042 00 Košice, Slovak RepublicIn this paper we describe by pseudo-code the ``Algorithm of the cyclic-order graph'', which we programmed in MATLAB 2016a and which is also possible to be executed in GNU Octave. We describe program's functionality and its use. The program implementing this algorithm is an indispensable tool during proofs in the field of graph theory, especially when dealing with crossing numbers for join products of graphs with paths of given numbers of vertices.http://www.aei.tuke.sk/papers/2018/1/01_Berezny.pdfcrossing numbercyclic permutationsalgorithmgraphdistances in graph
collection DOAJ
language English
format Article
sources DOAJ
author Štefan Berežný
Ján Buša, Jr.
Michal Staš
spellingShingle Štefan Berežný
Ján Buša, Jr.
Michal Staš
Software Solution of the Algorithm of the Cyclic-Order Graph
Acta Electrotechnica et Informatica
crossing number
cyclic permutations
algorithm
graph
distances in graph
author_facet Štefan Berežný
Ján Buša, Jr.
Michal Staš
author_sort Štefan Berežný
title Software Solution of the Algorithm of the Cyclic-Order Graph
title_short Software Solution of the Algorithm of the Cyclic-Order Graph
title_full Software Solution of the Algorithm of the Cyclic-Order Graph
title_fullStr Software Solution of the Algorithm of the Cyclic-Order Graph
title_full_unstemmed Software Solution of the Algorithm of the Cyclic-Order Graph
title_sort software solution of the algorithm of the cyclic-order graph
publisher Technical University of Kosice
series Acta Electrotechnica et Informatica
issn 1335-8243
1338-3957
publishDate 2018-03-01
description In this paper we describe by pseudo-code the ``Algorithm of the cyclic-order graph'', which we programmed in MATLAB 2016a and which is also possible to be executed in GNU Octave. We describe program's functionality and its use. The program implementing this algorithm is an indispensable tool during proofs in the field of graph theory, especially when dealing with crossing numbers for join products of graphs with paths of given numbers of vertices.
topic crossing number
cyclic permutations
algorithm
graph
distances in graph
url http://www.aei.tuke.sk/papers/2018/1/01_Berezny.pdf
work_keys_str_mv AT stefanberezny softwaresolutionofthealgorithmofthecyclicordergraph
AT janbusajr softwaresolutionofthealgorithmofthecyclicordergraph
AT michalstas softwaresolutionofthealgorithmofthecyclicordergraph
_version_ 1725567337737748480