Hamiltonian N2‐locally connected claw‐free graphs

A graph G is N₂‐locally connected if for every vertex ν in G, the edges not incident with ν but having at least one end adjacent to ν in G induce a connected graph. In 1990, Ryjá?ek conjectured that every 3‐connected N₂‐locally connected claw‐free graph is Hamiltonian. This conjecture is proved in this note. © 2004 Wiley Periodicals, Inc. J Graph Theory 48: 142–146, 2005     

Analysis of queueing policies in QoS switches

It is widely accepted that next-generation networks will provide guaranteed services, in contrast to the “best effort” approach today. We study and analyze queueing policies for network switches that support the QoS (Quality of Service) feature. One realization of the QoS feature is that packets are not necessarily all equal, with some having higher priorities than the others. We model this situation by assigning an intrinsic value to each packet. In this paper we are concerned with three different queueing policies: the nonpreemptive model, the FIFO preemptive model, and the bounded delay model. We concentrate on the situation where the incoming traffic overloads the queue, resulting in packet loss. The objective is to maximize the total value of packets transmitted by the queueing policy. The difficulty lies in the unpredictable nature of the future packet arrivals. We analyze the performance of the online queueing policies via competitive analysis, providing upper and lower bounds for the competitive ratios. We develop practical yet sophisticated online algorithms (queueing policies) for the three queueing models. The algorithms in many cases have provably optimal worst-case bounds. For the nonpreemptive model, we devise an optimal online algorithm for the common 2-value model. We provide a tight logarithmic bound for the general nonpreemptive model. For the FIFO preemptive model, we improve the general lower bound to 1.414, while showing a tight bound of 1.434 for the special case of queue size 2. We prove that the bounded delay model with uniform delay 2 is equivalent to a modified FIFO preemptive model with queue size 2. We then give improved upper and lower bounds on the 2-uniform bounded delay model. We also show an improved lower bound of 1.618 for the 2-variable bounded delay model, matching the previously known upper bound.     

Circular perfect graphs

For 1 ≤ d ≤ k, let K_k/d be the graph with vertices 0, 1, …, k ? 1, in which i ～j if d ≤ |i ? j| ≤ k ? d. The circular chromatic number χ_c(G) of a graph G is the minimum of those k/d for which G admits a homomorphism to K_k/d. The circular clique number ω_c(G) of G is the maximum of those k/d for which K_k/d admits a homomorphism to G. A graph G is circular perfect if for every induced subgraph H of G, we have χ_c(H) = ω_c(H). In this paper, we prove that if G is circular perfect then for every vertex x of G, N_G[x] is a perfect graph. Conversely, we prove that if for every vertex x of G, N_G[x] is a perfect graph and G ? N[x] is a bipartite graph with no induced P₅ (the path with five vertices), then G is a circular perfect graph. In a companion paper, we apply the main result of this paper to prove an analog of Haj?os theorem for circular chromatic number for k/d ≥ 3. Namely, we shall design a few graph operations and prove that for any k/d ≥ 3, starting from the graph K_k/d, one can construct all graphs of circular chromatic number at least k/d by repeatedly applying these graph operations. © 2005 Wiley Periodicals, Inc. J Graph Theory 48: 186–209, 2005     

Regular Balanced Cayley Maps for Cyclic, Dihedral and Generalized Quaternion Groups

A Cayley map is a Cayley graph embedded in an orientable surface such that. the local rotations at every vertex are identical. In this paper, balanced regular Cayley maps for cyclic groups, dihedral groups, and generalized quaternion groups are classified.     

Elliptic equations with BMO coefficients in Reifenberg domains

The inhomogeneous Dirichlet problems concerning divergence form elliptic equations are studied. Optimal regularity requirements on the coefficients and domains for the W^1,p theory, 1 < p < ∞, are obtained. The principal coefficients are supposed to be in the John‐Nirenberg space with small BMO seminorms. The domain is a Reifenberg domain. These conditions for the W^1,p theory not only weaken the requirements on the coefficients but also lead to a more general geometric condition on the domains. In fact, these domains might have fractal dimensions. © 2004 Wiley Periodicals, Inc.     

Crystallization and morphology of poly(vinylidene fluoride)/poly(3‐hydroxybutyrate) blends. I. Spherulitic morphology and growth by polarized microscopy

The development of the poly(3‐hydroxybutyrate) (PHB) morphology in the presence of already existent poly(vinylidene fluoride) (PVDF) spherulites was studied by two‐stage solidification with two separate crystallization temperatures. PVDF formed irregular dendrites at lower temperatures and regular, banded spherulites at elevated temperatures. The transition temperature of the spherulitic morphology from dendrites to regular, banded spherulites increased with increasing PVDF content. A remarkable amount of PHB was included in the PVDF dendrites, whereas PHB was rejected into the remaining melt from the banded spherulites. When PVDF crystallized as banded spherulites, PHB could consequently crystallize only around them, if at all. In contrast, PHB crystallized with a common growth front, starting from a defined site in the interfibrillar regions of volume‐filling PVDF dendrites. It formed by itself dendritic spherulites that included a large number of PVDF spherulites. For blends with a PHB content of more than 80 wt %, for which the PVDF dendrites were not volume‐filling, PHB first formed regular spherulites. Their growth started from outside the PVDF dendrites but could later interpenetrate them, and this made their own morphology dendritic. These PHB spherulites melted stepwise because the lamellae inside the PVDF dendrites melted at a lower temperature than those from outside. This reflected the regularity of the two fractions of the lamellae because that of those inside the dendrites of PVDF was controlled by the intraspherulitic order of PVDF, whereas that from outside was only controlled by the temperature and the melt composition. The described morphologies developed without mutual nucleating efficiency of the components. © 2003 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 41: 873–882, 2003     

Crystallographic report: catena‐Aqua(2,2′‐bipyrimidine)lithium(I) perchlorate

A lithium(I) coordination polymer has been formed from LiClO₄ and the 2,2′‐bipyrimidine (bpym) ligand in which each square pyramidal lithium(I) atom is coordinated in the basal plane by four nitrogen donor atoms derived from two bpym ligands and one water molecule at the apical position. These are connected into a layer structure via hydrogen‐bonding interactions involving the perchlorate anions. Copyright © 2004 John Wiley & Sons, Ltd.     

A model study for the steady state error of numerical approximations of inviscid flow equations on Cartesian grid

The widely used locally adaptive Cartesian grid methods involve a series of abruptly refined interfaces. In this paper we consider the influence of the refined interfaces on the steady state errors for second‐order three‐point difference approximations of flow equations. Since the various characteristic components of the Euler equations should behave similarly on such grids with regard to refinement‐induced errors, it is sufficient enough to conduct the analysis on a scalar model problem. The error we consider is a global error, different to local truncation error, and reflects the interaction between multiple interfaces. The steady state error will be compared to the errors on smooth refinement grids and on uniform grids. The conclusion seems to support the numerical findings of Yamaleev and Carpenter (J. Comput. Phys. 2002; 181: 280–316) that refinement does not necessarily reduce the numerical error. Copyright © 2005 John Wiley & Sons, Ltd.