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.     

拓扑线性空间中的Drop定理和Phelps引理以及Ekeland变分原理

将Phelps引理, Ekeland变分原理, Pareto有效性定理推广到拓扑线性空间,同时证明了这三个定理与郑喜印证明的拓扑线性空间中的Drop定理彼此等价．     

Norms and perfect graphs

The weak Berge hypothesis states that a graph is perfect if and only if its complement is perfect. Previous proofs of this hypothesis have used combinatorial or polyhedral methods.In this paper, the concept of norms related to graphs is used to provide an alternative proof for the weak Berge hypothesis.This is a written account of an invited lecture delivered by the second author on occasion of the 12. Symposium on Operations Research, Passau, 9.–11. 9. 1987.     

The Choquet-Deny convolution equation μ=μ*σ for probability measures on Abelian semigroups

In this note, we characterize the regular probability measures satisfying the Choquet-Deny convolution equation =* on Abelian topological semigroups for a given probability measure .     

Circuit-switching networks with FIFO plus justifying blockout service on infinite graphs

A class of circuit-switching open queueing networks is discussed. The main result of the paper is that if extra message flows are not too intensive and the path distribution is mainly concentrated on the paths of (graph) distance 1 (nearest neighbour connections), then the network has a unique stationary working regime, no matter how large the configuration graph of the network is. Standard properties of this regime are established such as decay of correlation and continuity.     

On the cover time of random walks on graphs

This article deals with random walks on arbitrary graphs. We consider the cover time of finite graphs. That is, we study the expected time needed for a random walk on a finite graph to visit every vertex at least once. We establish an upper bound ofO(n ²) for the expectation of the cover time for regular (or nearly regular) graphs. We prove a lower bound of (n logn) for the expected cover time for trees. We present examples showing all our bounds to be tight.Mike Saks was supported by NSF-DMS87-03541 and by AFOSR-0271. Jeff Kahn was supported by MCS-83-01867 and by AFOSR-0271.     

拓扑指数法研究显色剂结构与反应性能关系

本文讨论了２９个不对称色酸双偶氮膦酸型显色剂的分子联接性指数，并将其与结构选择性因子相结合，用于偶氮类剂结构与铈显色反应灵敏度的相关性研究，讨论了显色剂结构对显色反应灵敏度的影响。     

NH_2基态和激发态的SAC－CI和量子拓扑方法研究

ＮＨ_２基态和激发态的ＳＡＣ－ＣＩ和量子拓扑方法研究郑世钧，蔡新华，宋天乐，孟令鹏，中迁博，波田雅彦（河北师范学院化学系，石家庄，０５００９１）（京都大学工程学院京都，日本）关键词ＳＡＣ－ＣＩ方法，激发态，电子密度，拓扑分析用量子拓扑学方法研究激发态...     

Asymptotically independent topological indices on random trees

Topological indices are graph invariants used in computational chemistry to encode molecules. A frequent problem when performing structure-activity studies is that topological indices are inter-correlated. We consider a simple topological index and show asymptotic independence for a random tree model. This continues previous work on the correlation among topological indices. These findings suggest that a size-dependence in a certain class of distance-based topological indices can be eliminated.AMS subject classification: 05C80, 60E10, 92E10