Results 31 to 40 of about 1,286,422 (323)
On the crossing number of join product of the discrete graph with special graphs of order five
Electronic Journal of Graph Theory and Applications, 2020 The main aim of the paper is to give the crossing number of join product G+Dn for the disconnected graph G of order five consisting of the complete graph K4 and of one isolated vertex.
Michal Staš
doaj +1 more source
The Crossing Number of Hexagonal Graph H3,n in the Projective Plane
Discussiones Mathematicae Graph Theory, 2022 Thomassen described all (except finitely many) regular tilings of the torus S1 and the Klein bottle N2 into (3,6)-tilings, (4,4)-tilings and (6,3)-tilings.
Wang Jing +3 more
doaj +1 more source
Skewness and the crossing numbers of graphs
AIMS Mathematics, 2023 The skewness of a graph $ G $, $ sk(G) $, is the smallest number of edges that need to be removed from $ G $ to make it planar. The crossing number of a graph $ G $, $ cr(G) $, is the minimum number of crossings over all possible drawings of $ G $. There
Zongpeng Ding
doaj +1 more source
Crossing Numbers and Cutwidths [PDF]
Journal of Graph Algorithms and Applications, 2003 Summary: The crossing number of a graph \(G= (V, E)\), denoted by \(\text{cr}(G)\), is the smallest number of edge crossings in any drawing of \(G\) in the plane. We assume that the drawing is good, i.e., incident edges do not cross, two edges cross at most once and at most two edges cross in a point of the plane. \textit{F. T.
Imrich Vrto, Hristo N. Djidjev
openaire +3 more sources
On the crossing number for Kronecker product of a tripartite graph with path
AKCE International Journal of Graphs and Combinatorics, 2020 The crossing number of a graph G, Cr(G) is the minimum number of edge crossings overall good drawings of G. Among the well-known four standard graph products namely Cartesian product, Kronecker product, strong product and lexicographic product, the one ...
N. Shanthini, J. Baskar Babujee
doaj +1 more source
The crossing numbers of join products of four graphs of order five with paths and cycles [PDF]
Opuscula Mathematica, 2023 The crossing number \(\mathrm{cr}(G)\) of a graph \(G\) is the minimum number of edge crossings over all drawings of \(G\) in the plane. In the paper, we extend known results concerning crossing numbers of join products of four small graphs with paths ...
Michal Staš, Mária Timková
doaj +1 more source
Degenerate Crossing Numbers [PDF]
Discrete & Computational Geometry, 2006 Let G be a graph with n vertices and e ≥ 4n edges, drawn in the plane in such a way that if two or more edges (arcs) share an interior point p ,then they must properly cross one another at p. It is shown that the number of crossing points, counted without multiplicity, is at least constant times e and that the order of magnitude of this bound cannot be
Pach, János, Tóth, Géza
openaire +2 more sources
Software Solution of the Algorithm of the Cyclic-Order Graph [PDF]
Acta Electrotechnica et Informatica, 2018 In this paper we describe by pseudo-code the ``Algorithm of the cyclic-order graph'', which we programmed in MATLAB 2016a and which is also possible to be executed in GNU Octave. We describe program's functionality and its use.
Štefan Berežný +2 more
doaj +1 more source
The Bundled Crossing Number [PDF]
, 2016 Appears in the Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD 2016)
Md. Jawaherul Alam +3 more
openaire +4 more sources
On the crossing numbers of join products of W_{4}+P_{n} and W_{4}+C_{n} [PDF]
Opuscula Mathematica, 2021 The crossing number \(\mathrm{cr}(G)\) of a graph \(G\) is the minimum number of edge crossings over all drawings of \(G\) in the plane. The main aim of the paper is to give the crossing number of the join product \(W_4+P_n\) and \(W_4+C_n\) for the ...
Michal Staš, Juraj Valiska
doaj +1 more source