Axioms, Volume 13, Issue 7 (July 2024) – 77 articles
Cover Story (view full-size image):
The crossing number of a graph is a significant measure that indicates the complexity of the graph and the difficulty of visualizing it. In this paper, we examine the crossing numbers of join products involving the complete graph K5 with discrete graphs, paths, and cycles. We analyze optimal drawings of K5, identify all five non-isomorphic drawings, and address previously hypothesized crossing numbers for K5 + Pn and K5 + Cn. Through a simplified approach, we first establish cr(K5 + Dn) and then extend our method to prove the crossing numbers cr(K5 + Pn) and cr(K5 + Cn). These results also lead to new hypotheses for cr(Wm + Sn) and cr(Wm + Wn) involving wheels and stars. Our findings correct previous inaccuracies in the literature and provide a foundation for future research. View this paper
- Issues are regarded as officially published after their release is announced to the table of contents alert mailing list.
- You may sign up for e-mail alerts to receive table of contents of newly released issues.
- PDF is the official format for papers published in both, html and pdf forms. To view the papers in pdf format, click on the "PDF Full-text" link, and use the free Adobe Reader to open them.
Previous Issue
Next Issue
