Crossing Number of Toroidal Graphs
نویسندگان
چکیده
It is shown that if a graph of n vertices can be drawn on the torus without edge crossings and the maximum degree of its vertices is at most d, then its planar crossing number cannot exceed cdn, where c is a constant. This bound, conjectured by Brass, cannot be improved, apart from the value of the constant. We strengthen and generalize this result to the case when the graph has a crossing-free drawing on an orientable surface of higher genus and there is no restriction on the degrees of the vertices.
منابع مشابه
Minimum Tenacity of Toroidal graphs
The tenacity of a graph G, T(G), is dened by T(G) = min{[|S|+τ(G-S)]/[ω(G-S)]}, where the minimum is taken over all vertex cutsets S of G. We dene τ(G - S) to be the number of the vertices in the largest component of the graph G - S, and ω(G - S) be the number of components of G - S.In this paper a lower bound for the tenacity T(G) of a graph with genus γ(G) is obtained using the graph's connec...
متن کاملApproximating the Crossing Number of Toroidal Graphs
CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time approximation algorithm is known for this NP-Complete problem. We give in this paper a polynomial time approximation algorithm for the crossing number of toroidal graphs with bounded degree. In course of proving the algorithm we p...
متن کاملHow to Eliminate Crossings by Adding Handles or Crosscaps
Let c k = cr k (G) denote the minimum number of edge crossings when a graph G is drawn on an orientable surface of genus k. The (orientable) crossing sequence c 0 ; c 1 ; c 2 ; : : : encodes the trade-oo between adding handles and decreasing crossings. We focus on sequences of the type c 0 > c 1 > c 2 = 0; equivalently, we study the planar and toroidal crossing number of doubly-toroidal graphs....
متن کاملOn independent domination numbers of grid and toroidal grid directed graphs
A subset $S$ of vertex set $V(D)$ is an {em indpendent dominating set} of $D$ if $S$ is both an independent and a dominating set of $D$. The {em indpendent domination number}, $i(D)$ is the cardinality of the smallest independent dominating set of $D$. In this paper we calculate the independent domination number of the { em cartesian product} of two {em directed paths} $P_m$ and $P_n$ for arbi...
متن کاملToroidal Grid Minors and Stretch in Embedded Graphs∗
1 We investigate the toroidal expanse of an embedded graph G, that is, the size of the largest 2 toroidal grid contained in G as a minor. In the course of this work we introduce a new embedding 3 density parameter, the stretch of an embedded graph G, and use it to bound the toroidal 4 expanse from above and from below within a constant factor depending only on the genus and 5 the maximum degree...
متن کاملMETA-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کامل