Determining Crossing Number of Join of the Discrete Graph with Two Symmetric Graphs of Order Five
Faculty of Electrical Engineering and Informatics, Technical University of Košice, 040 01 Košice, Slovakia
Received: 19 December 2018 / Revised: 17 January 2019 / Accepted: 18 January 2019 / Published: 22 January 2019
PDF [437 KB, uploaded 22 January 2019]
The main aim of the paper is to give the crossing number of the join product
for the disconnected graph G
of order five consisting of one isolated vertex and of one vertex incident with some vertex of the three-cycle, and
consists of n
isolated vertices. In the proofs, the idea of the new representation of the minimum numbers of crossings between two different subgraphs that do not cross the edges of the graph G
by the graph of configurations
in the considered drawing D
will be used. Finally, by adding some edges to the graph G
, we are able to obtain the crossing numbers of the join product with the discrete graph
and with the path
vertices for three other graphs.
This is an open access article distributed under the Creative Commons Attribution License
which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
Share & Cite This Article
MDPI and ACS Style
Staš, M. Determining Crossing Number of Join of the Discrete Graph with Two Symmetric Graphs of Order Five. Symmetry 2019, 11, 123.
Staš M. Determining Crossing Number of Join of the Discrete Graph with Two Symmetric Graphs of Order Five. Symmetry. 2019; 11(2):123.
Staš, Michal. 2019. "Determining Crossing Number of Join of the Discrete Graph with Two Symmetric Graphs of Order Five." Symmetry 11, no. 2: 123.
Show more citation formats
Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.
[Return to top]
For more information on the journal statistics, click here
Multiple requests from the same IP address are counted as one view.