Space-efficient geometric divide-and-conquer algorithms

We develop a number of space-efficient tools including an approach to simulate divide-and-conquer space-efficiently, stably selecting and unselecting a subset from a sorted set, and computing the kth smallest element in one dimension from a multi-dimensional set that is sorted in another dimension. We then apply these tools to solve several geometric problems that have solutions using some form of divide-and-conquer. Specifically, we present a deterministic algorithm running in time using extra memory given inputs of size n for the closest pair problem and a randomized solution running in expected time and using extra space for the bichromatic closest pair problem. For the orthogonal line segment intersection problem, we solve the problem in time using extra space where n is the number of horizontal and vertical line segments and k is the number of intersections.     

Bounds on eigenvalues and chromatic numbers

We give new bounds on eigenvalue of graphs which imply some known bounds. In particular, if T(G) is the maximum sum of degrees of vertices adjacent to a vertex in a graph G, the largest eigenvalue ρ(G) of G satisfies with equality if and only if either G is regular or G is bipartite and such that all vertices in the same part have the same degree. Consequently, we prove that the chromatic number of G is at most with equality if and only if G is an odd cycle or a complete graph, which implies Brook's theorem. A generalization of this result is also given.     

A note on 2-factors with two components

In this note, we consider a minimum degree condition for a hamiltonian graph to have a 2-factor with two components. Let G be a graph of order n3. Dirac's theorem says that if the minimum degree of G is at least , then G has a hamiltonian cycle. Furthermore, Brandt et al. [J. Graph Theory 24 (1997) 165–173] proved that if n8, then G has a 2-factor with two components. Both theorems are sharp and there are infinitely many graphs G of odd order and minimum degree which have no 2-factor. However, if hamiltonicity is assumed, we can relax the minimum degree condition for the existence of a 2-factor with two components. We prove in this note that a hamiltonian graph of order n6 and minimum degree at least has a 2-factor with two components.     

A technique for multicoloring triangle-free hexagonal graphs

In order to avoid interference in cellular telephone networks, sets of radio frequencies are to be assigned to transmitters such that adjacent transmitters are allotted disjoint sets of frequencies. Often these transmitters are laid out like vertices of a triangular lattice in a plane. This problem corresponds to the problem of multicoloring an induced subgraph of a triangular lattice with integer demands associated with each vertex. We deal with the simpler case of triangle-free subgraphs of the lattice. [Frédéric Havet, Discrete Math. 233 (2001) 1–3] uses inductive arguments to prove that triangle-free hexagonal graphs can be colored with colors where ω_d is the maximum demand on a clique in the graph. We give a simpler proof and hope that our techniques can be used to prove the conjecture by [McDiarmid and Reed, Networks Suppl. 36 (2000) 114–117] that these graphs are -multicolorable.     

The last subconstituent of the Hemmeter graph

We prove that when q is any odd prime power, the distance-2 graph on the set of vertices at maximal distance D from any fixed vertex of the Hemmeter graph Hem_D(q) is isomorphic to the graph Quad_D-1(q) of quadratic forms on .     

Characterizations of maximum matching graphs of certain types

The maximum matching graph of a graph G is a graph whose vertices are maximum matchings of G and where two maximum matchings are adjacent in if they differ in exactly one edge. In this paper, the author characterizes the graphs whose maximum matching graphs are regular or cycles, and adds trees to the list of known maximum matching graphs.     

Sparse geometric graphs with small dilation

Given a set S of n points in , and an integer k such that 0k<n, we show that a geometric graph with vertex set S, at most n−1+k edges, maximum degree five, and dilation O(n/(k+1)) can be computed in time O(nlogn). For any k, we also construct planar n-point sets for which any geometric graph with n−1+k edges has dilation Ω(n/(k+1)); a slightly weaker statement holds if the points of S are required to be in convex position.     

Ore-type degree condition for heavy paths in weighted graphs

A weighted graph is one in which every edge e is assigned a nonnegative number w(e), called the weight of e. For a vertex v of a weighted graph, d^w(v) is the sum of the weights of the edges incident to v. And the weight of a path is the sum of the weights of the edges belonging to it. In this paper, we give a sufficient condition for a weighted graph to have a heavy path which joins two specified vertices. Let G be a 2-connected weighted graph and let x and y be distinct vertices of G. Suppose that d^w(u)+d^w(v)2d for every pair of non-adjacent vertices u and vV(G) x,y . Then x and y are joined by a path of weight at least d, or they are joined by a Hamilton path. Also, we consider the case when G has some vertices whose weighted degree are not assumed.     

Drawings of planar graphs with few slopes and segments

We study straight-line drawings of planar graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2-trees, and planar 3-trees. We prove that every 3-connected plane graph on n vertices has a plane drawing with at most segments and at most 2n slopes. We prove that every cubic 3-connected plane graph has a plane drawing with three slopes (and three bends on the outerface). In a companion paper, drawings of non-planar graphs with few slopes are also considered.     

Chaotic and bifurcation dynamic behavior of a simply supported rectangular orthotropic plate with thermo-mechanical coupling

This paper presents a novel analytical approach utilizing fractal dimension criteria and the maximum Lyapunov exponent to characterize the conditions which can potentially lead to the chaotic motion of a simply supported thermo-mechanically coupled orthotropic rectangular plate undergoing large deflections. The study commences by deriving the governing partial differential equations of the rectangular plate, and then applies the Galerkin method to simplify these equations to a set of three ordinary differential equations. The associated power spectra, phase plots, Poincaré map, maximum Lyapunov exponents, and fractal and bifurcation diagrams are computed numerically. These features are used to characterize the dynamic behavior of the orthotropic rectangular plate under various excitation conditions. The maximum Lyapunov exponents and the correlation dimensions method indicate that chaotic motion of the orthotropic plate occurs at η₁ = 1.0, , and for an external force of . The application of an external in-plane force of magnitude causes the orthotropic plate to perform bifurcation motion. Furthermore, when , aperiodic motion of the plate is observed. Hence, the dynamic motion of a thermo-mechanically coupled orthotropic rectangular plate undergoing large deflections can be controlled and manipulated to achieve periodic motion through an appropriate specification of the system parameters and loads.     

The total chromatic number of regular graphs of even order and high degree

The total chromatic number χ_T(G) of a graph G is the minimum number of colours needed to colour the edges and the vertices of G so that incident or adjacent elements have distinct colours. We show that if G is a regular graph of even order and , thenχ_T(G)Δ(G)+2.     

Nonlinear maps preserving Lie products on factor von Neumann algebras

In this paper, we prove that every bijective map preserving Lie products from a factor von Neumann algebra into another factor von Neumann algebra is of the form A→ψ(A)+ξ(A), where is an additive isomorphism or the negative of an additive anti-isomorphism and is a map with ξ(AB-BA)=0 for all .     

The PI index of product graphs

The Padmakar–Ivan index of a graph G is the sum over all edges uv of G of number of edges which are not equidistant from u and v. In this work, an exact expression for the PI index of the Cartesian product of bipartite graphs is computed. Using this formula, the PI indices of C₄ nanotubes and nanotori are computed.     

Precise asymptotics for the first moment of the error variance estimator in linear models

Let σ² be the unknown error variance of a linear model and let be the estimator of σ² based on the residual sum of squares. In this work, we show the precise asymptotics in the law of the logarithm for the first moment of the error variance estimator.     

Minimum weight pseudo-triangulations

We consider the problem of computing a minimum weight pseudo-triangulation of a set of n points in the plane. We first present an -time algorithm that produces a pseudo-triangulation of weight which is shown to be asymptotically worst-case optimal, i.e., there exists a point set for which every pseudo-triangulation has weight , where is the weight of a minimum weight spanning tree of . We also present a constant factor approximation algorithm running in cubic time. In the process we give an algorithm that produces a minimum weight pseudo-triangulation of a simple polygon.     

Graph drawings with few slopes

The slope-number of a graph G is the minimum number of distinct edge slopes in a straight-line drawing of G in the plane. We prove that for Δ5 and all large n, there is a Δ-regular n-vertex graph with slope-number at least . This is the best known lower bound on the slope-number of a graph with bounded degree. We prove upper and lower bounds on the slope-number of complete bipartite graphs. We prove a general upper bound on the slope-number of an arbitrary graph in terms of its bandwidth. It follows that the slope-number of interval graphs, cocomparability graphs, and AT-free graphs is at most a function of the maximum degree. We prove that graphs of bounded degree and bounded treewidth have slope-number at most . Finally we prove that every graph has a drawing with one bend per edge, in which the number of slopes is at most one more than the maximum degree. In a companion paper, planar drawings of graphs with few slopes are also considered.     

Sign balance for finite groups of Lie type

A product formula for the parity generating function of the number of 1’s in invertible matrices over is given. The computation is based on algebraic tools such as the Bruhat decomposition. It is somewhat surprising that the number of such matrices with odd number of 1’s is greater than the number of those with even number of 1’s. The same technique can be used to obtain a parity generating function also for symplectic matrices over . We present also a generating function for the sum of entries of matrices over an arbitrary finite field calculated in . The Mahonian distribution appears in these formulas.     

A non-normal topology generated by a two-point selection

We construct a two-point selection , where is the set of the irrational numbers, such that the space is not normal and it is not collectionwise Hausdorff either. Here, τ_f denotes the topology generated by the two-point selection f. This example answers a question posed by V. Gutev and T. Nogura. We also show that if is a two-point selection such that the topology τ_f has countable pseudocharacter, then τ_f is a Tychonoff topology.     

A result about the density of iterated line intersections in the plane

Let S be a finite set of points in the plane and let be the set of intersection points between pairs of lines passing through any two points in S. We characterize all configurations of points S such that iteration of the above operation produces a dense set. We also discuss partial results on the characterization of those finite point-sets with rational coordinates that generate all of through iteration of .     

An algorithm for calculating the independence and vertex-cover polynomials of a graph

The independence polynomial, ω(G,x)=∑w_kx^k, of a graph, G, has coefficients, w_k, that enumerate the ways of selecting k vertices from G so that no two selected vertices share an edge. The independence number of G is the largest value of k for which w_k≠0. Little is known of less straightforward relationships between graph structure and the properties of ω(G,x), in part because of the difficulty of calculating values of w_k for specific graphs. This study presents a new algorithm for these calculations which is both faster than existing ones and easily adaptable to high-level computer languages.