Results 31 to 40 of about 307,259 (304)
The Crossing Number of Join of a Special Disconnected 6-Vertex Graph with Cycle
Mathematics, 2023 The crossing number of a graph G, cr(G), is defined as the smallest possible number of edge-crossings in a drawing of G in the plane. There are almost no results concerning crossing number of join of a disconnected 6-vertex graph with cycle. The main aim
Zongpeng Ding, Xiaomei Qian
doaj +1 more source
Plick Graphs with Crossing Number 1 [PDF]
, 2011 In this paper, we deduce a necessary and sufficient condition for graphs whose plick graphs have crossing number 1. We also obtain a necessary and sufficient condition for plick graphs to have crossing number 1 in terms of forbidden ...
Basavanagoud, B., Kulli, V.R.
core +1 more source
ALTERNATIVE PROOF ON THE CROSSING NUMBER OF K1,1,3,N [PDF]
Acta Electrotechnica et Informatica, 2019 The main aim of the paper is to give the crossing number of join product G+Dn for the connected graph G of order five isomorphic with the complete tripartite graph K1,1,3, where Dn consists on n isolated vertices.
Michal STAS
doaj +1 more source
The crossing number of the generalized Petersen graph $P[3k,k]$ [PDF]
, 2003 summary:Guy and Harary (1967) have shown that, for $k\ge 3$, the graph $P[2k,k]$ is homeomorphic to the Möbius ladder ${M_{2k}}$, so that its crossing number is one; it is well known that $P[2k,2]$ is planar. Exoo, Harary and Kabell (1981) have shown hat
Fiorini, Stanley, Gauci, John Baptist
core +1 more source
The Crossing Numbers of Join Products of Paths and Cycles with Four Graphs of Order Five
Mathematics, 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
Proceedings of the twenty-seventh annual symposium on Computational geometry, 2011 We define a variant of the crossing number for an embedding of a graphGinto ℝ3, and prove a lower bound on it which almost implies the classical crossing lemma. We also give sharp bounds on the rectilinear space crossing numbers of pseudo-random graphs.
Boris Bukh, Alfredo Hubard
openaire +3 more sources
Improvement on the Crossing Number of Crossing-Critical Graphs [PDF]
Discrete & Computational Geometry, 2020 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 0001
openaire +5 more sources
Parity Properties of Configurations
Mathematics, 2022 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
Expected Crossing Numbers [PDF]
Electronic Notes in Discrete Mathematics, 2011 The expected value for the weighted crossing number of a randomly weighted graph is studied. A variation of the Crossing Lemma for expectations is proved. We focus on the case where the edge-weights are independent random variables that are uniformly distributed on [0,1].
Bojan Mohar, Tamon Stephen
openaire +2 more sources
Exploring the relative importance of crossing number and crossing angle [PDF]
, 2010 Recent research has indicated that human graph reading perfor-mance can be affected by the size of crossing angle. Crossing an-gle is closely related to another aesthetic criterion: number of edge crossings.
Huang, M (15585458), Huang, W (15585434)
core +2 more sources