The distribution of the domination number of class cover catch digraphs for non-uniform one-dimensional data

For two or more classes of points in R^d with d≥1, the class cover catch digraphs (CCCDs) can be constructed using the relative positions of the points from one class with respect to the points from one or all of the other classes. The CCCDs were introduced by Priebe et al. [C.E. Priebe, J.G. DeVinney, D.J. Marchette, On the distribution of the domination number of random class catch cover digraphs. Statistics and Probability Letters 55 (2001) 239-246] who investigated the case of two classes, X and Y. They calculated the exact (i.e., finite sample) distribution of the domination number of the CCCDs based on X points relative to Y points both of which were uniformly distributed on a bounded interval. We investigate the distribution of the domination number of the CCCDs based on data from non-uniform X points on an interval with end points from Y. Then we extend these calculations for multiple Y points on bounded intervals.     

Game coloring the Cartesian product of graphs

This article proves the following result: Let G and G′ be graphs of orders n and n′, respectively. Let G^* be obtained from G by adding to each vertex a set of n′ degree 1 neighbors. If G^* has game coloring number m and G′ has acyclic chromatic number k, then the Cartesian product G□G′ has game chromatic number at most k(k + m ? 1). As a consequence, the Cartesian product of two forests has game chromatic number at most 10, and the Cartesian product of two planar graphs has game chromatic number at most 105. © 2008 Wiley Periodicals, Inc. J Graph Theory 59: 261–278, 2008     

完全3-部图K_(1，10，n)的交叉数

在上世纪五十年代初,Zarankiewicz猜想完全2-部图Km,m(m≤n)的交叉数为[m/2][m-1/2][n/2][n-1/2](对任意实数x,[x]表示不超过x的最大整数),目前只证明了当m ≤ 6时,Zarankiewicz猜想是正确的.假定Zarankiewicz猜想对m=11的情形成立,本文确定完全3-部图K1,10,n的交叉数.     

F_m∨P_n的点可区别边色数

研究了Fm∨Pn的点可区别边染色,给出了Fm∨Pn的点可区别边色数.     

Continuous Utility Representation Theorems in Arbitrary Concrete Categories

In this paper the continuous utility representation problem will be discussed in arbitrary concrete categories. In particular, generalizations of the utility representation theorems of Eilenberg, Debreu and Estévez and Hervés will be presented that also hold if the codomain of a utility function is an arbitrary totally ordered set and not just the real line. In addition, we shall prove and apply a general result on the characterization of structures that have the property that every continuous total preorder has a continuous utility representation. Finally, generalizations of the utility representation theorems of Debreu and Eilenberg will be discussed that are valid if we consider arbitrary binary relations and allow a utility function to have values in an arbitrary totally ordered set.      

The influence of heat and mass transfer on MHD peristaltic flow through a porous space with compliant walls

The present study investigates the effects of heat and mass transfer on peristaltic transport in a porous space with compliant walls. The fluid is electrically conducting in the presence of a uniform magnetic field. Analytic solution is carried out under long-wavelength and low-Reynolds number approximations. The expressions for stream function, temperature, concentration and heat transfer coefficient are obtained. Numerical results are graphically discussed for various values of physical parameters of interest.     

Determination of the octane number of a fuel by the IR spectroscopy method

The near-IR spectroscopy method of control of the octane number (o.n.) of a fuel is studied. An analysis is made of a device developed as an alternative of a measuring system based on a nonselective IR radiation source and of an analyzer based on a laser semiconductor diode. It is shown that the use of the methods of multicomponent regression analysis of spectral data allows measurement of the octane number with an accuracy of S ∼ 0.17 octane number units. The characteristics of the semiconductor laser-based analyzer are investigated and the parameters of radiators are discussed that provide the required sensitivity of the measuring system (up to 10⁻⁴ with respect to optical absorption) in controlling the octane number of a fucl. Translated from Zhurnal Prikladnoi Spektroskopii, Vol. 67, No. 2, pp. 244–248, March–April, 2000.     

Distance graphs with maximum chromatic number

The distance graph G(D) has the set of integers as vertices and two vertices are adjacent in G(D) if their difference is contained in the set D⊂Z. A conjecture of Zhu states that if the chromatic number of G(D) achieves its maximum value |D|+1 then the graph has a triangle. The conjecture is proven to be true if |D|?3. We prove that the chromatic number of a distance graph with D={a,b,c,d} is five only if either D={1,2,3,4k} or D={a,b,a+b,b-a}. This confirms a stronger version of Zhu's conjecture for |D|=4, namely, if the chromatic number achieves its maximum value then the graph contains K₄.     

Total Domination in Graphs with Given Girth

A set S of vertices in a graph G without isolated vertices is a total dominating set of G if every vertex of G is adjacent to some vertex in S. The minimum cardinality of a total dominating set of G is the total domination number γ _t (G) of G. In this paper, we establish an upper bound on the total domination number of a graph with minimum degree at least two in terms of its order and girth. We prove that if G is a graph of order n with minimum degree at least two and girth g, then γ _t (G) ≤ n/2 + n/g, and this bound is sharp. Our proof is an interplay between graph theory and transversals in hypergraphs. Michael A. Henning: Research supported in part by the South African National Research Foundation and the University of KwaZulu-Natal.