A census of semisymmetric cubic graphs on up to 768 vertices

A list is given of all semisymmetric (edge- but not vertex-transitive) connected finite cubic graphs of order up to 768. This list was determined by the authors using Goldschmidt's classification of finite primitive amalgams of index (3,3), and a computer algorithm for finding all normal subgroups of up to a given index in a finitely-presented group. The list includes several previously undiscovered graphs. For each graph in the list, a significant amount of information is provided, including its girth and diameter, the order of its automorphism group, the order and structure of a minimal edge-transitive group of automorphisms, its Goldschmidt type, stabiliser partitions, and other details about its quotients and covers. A summary of all known infinite families of semisymmetric cubic graphs is also given, together with explicit rules for their construction, and members of the list are identified with these. The special case of those graphs having K_1,3 as a normal quotient is investigated in detail. Supported in part by N.Z. Marsden Fund (grant no. UOA 124) and N.Z. Centres of Research Excellence Fund (grant no. UOA 201) Supported in part by “Ministrstvo za šolstvo, znanost in šport Slovenije”, research program no. 101-506. Supported in part by research projects no. Z1-4186-0101 and no. Z1-3124-0101. The fourth author would like to thank the University of Auckland for hospitality during his visit there in 2003.     

Problems of an additional experiment

In some situations estimates of unknown parameters must be corrected by additional measurements. It is in principle no problem to calculate the corrected estimates, however, it is of more interest to find formulae for correction itself. The formulae enable us to design an additional experiment and to judge its usefulness. The aim of the paper is to find such formulae for several situations. Supported by the grant of the Council of Czech Government MSM 6 198 959 214.     

Three-pencil lattices on triangulations

In this paper, three-pencil lattices on triangulations are studied. The explicit representation of a lattice, based upon barycentric coordinates, enables us to construct lattice points in a simple and numerically stable way. Further, this representation carries over to triangulations in a natural way. The construction is based upon group action of S ₃ on triangle vertices, and it is shown that the number of degrees of freedom is equal to the number of vertices of the triangulation.      

Hydrazones Possessing a Phenyl-1,2,3,4-tetrahydroquinoline Moiety as Hole Transporting Materials

Hydrazones containing 1-phenyl-1,2,3,4-tetrahydroquinoline units were synthesized starting from diphenylamine. These compounds were found to constitute novel hole transporting materials and were characterized by the time of flight method. The hole drift mobility in these compounds exceeds 10⁻⁶ cm² V⁻¹ s⁻¹ at an electric field of 10⁶ V cm⁻¹.     

Aluminum(III) complexes containing O,O chelating ligand

The stoichiometric reactions of trimethylaluminum with 2,6‐(MeOCH₂)₂C₆H₃OH (LH) revealed compounds L₃Al ( 1 ) and L₂AlMe ( 2 ). On the other hand reaction of 1 equiv. of LH with trimethylaluminum did not lead to the formation of complex LAlMe₂ ( 3 ), rather 2 together with Me₃Al were observed as a result of a disproportionation of 3 . Compounds 1 and 2 were characterized by elemental analysis, ¹H and ¹³C NMR spectroscopy and in the case of 1 by X‐ray diffraction. Derivative 2 underwent transmetalation with Ph₃SnOH, giving LSnPh₃ ( 4 ) as the result of a migration of ligand L from the aluminum to the tin atom. The identity of 4 was established by elemental analysis, ¹H, ¹³C and ¹¹⁹Sn NMR spectroscopy and ¹H, ¹¹⁹Sn HMBC experiments. The system 2 and B(C₆F₅)₃ in a 1:1 molar ratio was shown to be active in the polymerization of propylene oxide and ε‐caprolactone. Copyright © 2007 John Wiley & Sons, Ltd.     

Bull-free Berge graphs are perfect

Abull is the (self-complementary) graph with verticesa, b, c, d, e and edgesab, ac, bc, bd, ce; a graphG is calledBerge if neitherG not its complement contains a chordless cycle whose length is odd and at least five. We prove that bull-free Berge graphs are perfect; a part of our argument relies on a new property of minimal imperfect graphs.This work was done while both authors were at the School of Computer Science, McGill University; support by NSERC is gratefully acknowledged.     

Modelling of composting of food waste in a column reactor

The composting of organic solid waste, the mixture of fruit and vegetable leftovers enriched with night soil, was investigated in a closed thermally insulated reactor. It was found that 80.9 % of the original substrate biodegraded after 14 days. A mathematical model of the column reactor was proposed where the biodegradation rate of the organic solid waste was described using simple n-thorder kinetics. A good prediction of process performance was obtained using the proposed kinetics and experimentally obtained reaction heat. Presented at the 33rd International Conference of the Slovak Society of Chemical Engineering, Tatranské Matliare, 22–26 May 2006.     

The temperature and pressure in the plasma parallel plate accelerator

This paper presents the results of plasma temperature and pressure calculations in the parallel plate accelerator during the accelerating process. The plasma pressure is calculated by means in Dalton's law.     

Composition formulae for some integro-differential operators and their applications

Institute of Mathematics and Informatics. Akademijos 4, 2600 Vilnius, Lithuania. Translated from Lietuvos Matematikos Rinkinys. Vol. 36, No. 1, pp. 27–38, January–March,. 1996.     

Dimensional reduction for Helmholtz's equation on a bounded domain

Summary. The dimensional reduction method for solving boundary value problems of Helmholtz's equation in domain by replacing them with systems of equations in dimensional space are investigated. It is proved that the existence and uniqueness for the exact solution and the dimensionally reduced solution of the boundary value problem if the input data on the faces are in some class of functions. In addition, the difference between and in is estimated as and are fixed. Finally, some numerical experiments in a domain are given in order to compare theretical results. Received April 2, 1996 / Revised version received July 30, 1990