Skip to main content Accessibility help
×
Home

DETERMINING CROSSING NUMBERS OF GRAPHS OF ORDER SIX USING CYCLIC PERMUTATIONS

  • MICHAL STAŠ (a1)

Abstract

We extend known results concerning crossing numbers by giving the crossing number of the join product $G+D_{n}$ , where the connected graph $G$ consists of one $4$ -cycle and of two leaves incident with the same vertex of the $4$ -cycle, and $D_{n}$ consists of $n$ isolated vertices. The proofs are done with the help of software that generates all cyclic permutations for a given number $k$ and creates a graph for calculating the distances between all $(k-1)!$ vertices of the graph.

Copyright

Footnotes

Hide All

The research was supported by the internal faculty research project no. FEI-2017-39.

Footnotes

References

Hide All
[1] Berežný, Š., Buša, J. Jr and Staš, M., ‘Software solution of the algorithm of the cyclic-order graph’, Acta Electrotech. Inform. 18(1) (2018), 310.
[2] Berežný, Š. and Staš, M., ‘On the crossing number of the join of five vertex graph G with the discrete graph D n ’, Acta Electrotech. Inform. 17(3) (2017), 2732.
[3] Berežný, Š. and Staš, M., ‘Cyclic permutations and crossing numbers of join products of symmetric graph of order six’, Carpathian J. Math. 34(2) (2018), 143155.
[4] Hernández-Vélez, C., Medina, C. and Salazar, G., ‘The optimal drawing of K 5, n ’, Electron. J. Combin. 21(4) (2014), P4.1, 29 pages.
[5] Kleitman, D. J., ‘The crossing number of K 5, n ’, J. Combin. Theory 9 (1970), 315323.
[6] Klešč, M., ‘The join of graphs and crossing numbers’, Electron. Notes Discrete Math. 28 (2007), 349355.
[7] Klešč, M., ‘The crossing number of join of the special graph on six vertices with path and cycle’, Discrete Math. 310 (2010), 14751481.
[8] Klešč, M., Petrillová, J. and Valo, M., ‘On the crossing numbers of Cartesian products of wheels and trees’, Discuss. Math. Graph Theory 71 (2017), 339413.
[9] Klešč, M. and Schrötter, Š., ‘The crossing numbers of join products of paths with graphs of order four’, Discuss. Math. Graph Theory 31 (2011), 312331.
[10] Klešč, M. and Schrötter, Š., ‘The crossing numbers of join of paths and cycles with two graphs of order five’, in: Mathematical Modeling and Computational Science, Lecture Notes in Computer Science, 7125 (Springer, Berlin–Heidelberg, 2012), 160167.
[11] Staš, M., ‘On the crossing number of the join of the discrete graph with one graph of order five’, Math. Model. Geom. 5(2) (2017), 1219.
[12] Staš, M., ‘Cyclic permutations: crossing numbers of the join products of graphs’, in: Proc. APLIMAT 2018: 17th Conf. Applied Mathematics (Slovak University of Technology, Bratislava, 2018), 979987.
[13] Woodall, D. R., ‘Cyclic-order graphs and Zarankiewicz’s crossing number conjecture’, J. Graph Theory 17 (1993), 657671.
MathJax
MathJax is a JavaScript display engine for mathematics. For more information see http://www.mathjax.org.

Keywords

MSC classification

DETERMINING CROSSING NUMBERS OF GRAPHS OF ORDER SIX USING CYCLIC PERMUTATIONS

  • MICHAL STAŠ (a1)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed