IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v9y2021i11p1277-d567459.html
   My bibliography  Save this article

The Crossing Numbers of Join Products of Paths and Cycles with Four Graphs of Order Five

Author

Listed:
  • Michal Staš

    (Faculty of Electrical Engineering and Informatics, Technical University of Košice, 042 00 Košice, Slovakia)

Abstract

The main aim of the paper is to establish the crossing numbers of the join products of the paths and the cycles on n vertices with a connected graph on five vertices isomorphic to the graph K 1 , 1 , 3 \ e obtained by removing one edge e incident with some vertex of order two from the complete tripartite graph K 1 , 1 , 3 . The proofs are done with the help of well-known exact values for the crossing numbers of the join products of subgraphs of the considered graph with paths and cycles. Finally, by adding some edges to the graph under consideration, we obtain the crossing numbers of the join products of other graphs with the paths and the cycles on n vertices.

Suggested Citation

  • Michal Staš, 2021. "The Crossing Numbers of Join Products of Paths and Cycles with Four Graphs of Order Five," Mathematics, MDPI, vol. 9(11), pages 1-13, June.
    • Handle: RePEc:gam:jmathe:v:9:y:2021:i:11:p:1277-:d:567459
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/9/11/1277/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/9/11/1277/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:9:y:2021:i:11:p:1277-:d:567459. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.