Results 31 to 40 of about 9,538,132 (298)
Maximum Cut Parameterized by Crossing Number
Journal of Graph Algorithms and Applications, 2020 Given an edge-weighted graph $G$ on $n$ nodes, the NP-hard $\rm{M\small{AX}}$-$\rm{C\small{UT}}$ problem asks for a node bipartition such that the sum of edge weights joining the different partitions is maximized.
Markus Chimani +5 more
doaj +1 more source
The crossing numbers of join products of eight graphs of order six with paths and cycles
Karpatsʹkì Matematičnì Publìkacìï, 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. The main aim of this paper is to give the crossing numbers of the join products of eight graphs on six vertices with paths ...
M. Staš
doaj +1 more source
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 number of the generalized Petersen graph P(3k,k) in the projective plane
AKCE International Journal of Graphs and Combinatorics, 2023 The crossing number of a graph G in a surface Σ, denoted by [Formula: see text], is the minimum number of pairwise intersections of edges in a drawing of G in Σ. Let k be an integer satisfying [Formula: see text], the generalized Petersen graph [Formula:
Jing Wang, Zuozheng Zhang
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.
Hristo N. Djidjev, Imrich Vrto
openaire +3 more sources
The crossing numbers of join products of paths with three graphs of order five [PDF]
Opuscula Mathematica, 2022 The main aim of this paper is to give the crossing number of the join product \(G^\ast+P_n\) for the disconnected graph \(G^\ast\) of order five consisting of the complete graph \(K_4\) and one isolated vertex, where \(P_n\) is the path on \(n\) vertices.
Michal Staš, Mária Švecová
doaj +1 more source
The Toroidal Crossing Number [PDF]
, 2011 Studying the crossing number of the complete bipartite graph K4,n in ...
Ling, Tang +2 more
core +1 more source
On the problems of CF-connected graphs
Electronic Journal of Graph Theory and Applications, 2023 The crossing number cr(G) of a graph G is the minimum number of edge crossings over all drawings of G in the plane, and the optimal drawing of G is any drawing at which the desired minimum number of crossings is achieved.
Michal Staš, Juraj Valiska
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
Characterization of semientire graphs with crossing number 2 [PDF]
, 2002 summary:The purpose of this paper is to give characterizations of graphs whose vertex-semientire graphs and edge-semientire graphs have crossing number 2.
Bano, J. K., Akka, D. G.
core +1 more source