Results 41 to 50 of about 1,312,414 (329)
On the Crossing Numbers of Cartesian Products of Wheels and Trees
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
Immersed disks, slicing numbers and concordance unknotting numbers [PDF]
We study three knot invariants related to smoothly immersed disks in the four-ball. These are the four-ball crossing number, which is the minimal number of normal double points of such a disk bounded by a given knot; the slicing number, which is the ...
Owens, Brendan, Strle, Saso
core +3 more sources
On the Crossing Numbers of Cartesian Products of Stars and Graphs of Order Six
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
The Crossing Numbers of Join Products of Paths and Cycles with Four Graphs of Order Five
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
Anomalous fermion number nonconservation: Paradoxes in the level crossing picture [PDF]
In theories with anomalous fermion number nonconservation, the level crossing picture is considered a faithful representation of the fermionic quantum number variation.
Burnier, Yannis
core +2 more sources
On the Degenerate Crossing Number [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ackerman, Eyal, Pinchasi, Rom
openaire +2 more sources
Parity Properties of Configurations
In the paper, the crossing number of the join product G*+Dn for the disconnected graph G* consisting of two components isomorphic to K2 and K3 is given, where Dn consists of n isolated vertices.
Michal Staš
doaj +1 more source
Improvement on the Crossing Number of Crossing-Critical Graphs [PDF]
AbstractThe crossing number of a graph G is the minimum number of edge crossings over all drawings of G in the plane. A graph G is k-crossing-critical if its crossing number is at least k, but if we remove any edge of G, its crossing number drops below k.
János Barát, Géza Tóth
openaire +5 more sources
Note on the Pair-crossing Number and the Odd-crossing Number [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
The Crossing Numbers of Join of Some Graphs with n Isolated Vertices
There are only few results concerning crossing numbers of join of some graphs. In this paper, for some graphs on five vertices, we give the crossing numbers of its join with n isolated vertices.
Ding Zongpeng, Huang Yuanqiu
doaj +1 more source

