Results 51 to 60 of about 10,813,555 (336)

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

open access: yesMathematics, 2021
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 K1,1,3\e obtained by removing one edge e incident with some ...
Michal Staš
doaj   +1 more source

On Graph Crossing Number and Edge Planarization [PDF]

open access: yes, 2010
Given an n-vertex graph G, a drawing of G in the plane is a mapping of its vertices into points of the plane, and its edges into continuous curves, connecting the images of their endpoints.
Chuzhoy, Julia   +2 more
core   +3 more sources

On the Crossing Numbers of Cartesian Products of Wheels and Trees

open access: yesDiscussiones Mathematicae Graph Theory, 2017
Bokal developed an innovative method for finding the crossing numbers of Cartesian product of two arbitrarily large graphs. In this article, the crossing number of the join product of stars and cycles are given.
Klešč Marián   +2 more
doaj   +1 more source

Improvement on the Decay of Crossing Numbers [PDF]

open access: yesGraphs and Combinatorics, 2008
7 pages, 1 ...
Jakub Černý, Jan Kynčl, Géza Tóth
openaire   +5 more sources

On the Crossing Numbers of Cartesian Products of Stars and Graphs of Order Six

open access: yesDiscussiones Mathematicae Graph Theory, 2013
The crossing number cr(G) of a graph G is the minimal number of crossings over all drawings of G in the plane. According to their special structure, the class of Cartesian products of two graphs is one of few graph classes for which some exact values of ...
Klešč Marián, Schrötter Štefan
doaj   +1 more source

On Cross Parsons Numbers

open access: yesGraphs and Combinatorics, 2018
Let $$F_q$$ be the field of size q and SL(n, q) be the special linear group of order n over the field $$F_q$$
Ku, Cheng Yeaw, Wong, Kok Bin
openaire   +3 more sources

The Crossing Number of the Cone of a Graph [PDF]

open access: yesSIAM Journal on Discrete Mathematics, 2016
Motivated by a problem asked by Richter and by the long standing Harary-Hill conjecture, we study the relation between the crossing number of a graph $G$ and the crossing number of its cone $CG$, the graph obtained from $G$ by adding a new vertex adjacent to all the vertices in $G$.
Marek Derňár   +3 more
openaire   +3 more sources

Crossing number of Cartesian product of prism and path

open access: yesAKCE International Journal of Graphs and Combinatorics, 2020
An m-prism is the Cartesian product of an m-cycle and a path with 2 vertices. We prove that the crossing number of the join of an m-prism () and a graph with k isolated vertices is km for each We then use this result to prove that the crossing number of ...
Yip C. Yiew, Gek L. Chia, Poh-Hwa Ong
doaj   +1 more source

Crossing Numbers of Join Product with Discrete Graphs: A Study on 6-Vertex Graphs

open access: yesMathematics, 2023
Reducing the number of crossings on graph edges can be useful in various applications, including network visualization, circuit design, graph theory, cartography or social choice theory.
Jana Fortes, Michal Staš
doaj   +1 more source

Crossing Numbers of Periodic Graphs [PDF]

open access: yesJournal of Graph Theory, 2015
AbstractA graph is periodic if it can be obtained by joining identical pieces in a cyclic fashion. It is shown that the limit crossing number of a periodic graph is computable. This answers a question of Richter [1, Problem 4.2].
Zdeněk Dvořák, Bojan Mohar
openaire   +3 more sources

Home - About - Disclaimer - Privacy