PANCYCLICITY IN LINE GRAPHS

1IntroductionWeuseBondyandMurtyl3]forterminologyand..ta'ti..notdefinedhereandconsidersimpleconnectedgraphsonly.AcircuitCofagraphGisanontrivialconnectedeuleriansubgraphofG.Aspanningcircuit,orbrieflyS-circuit,ofagraphGisacircuitthatcontainsallvenicesofG.AdominatingcircuitorD-circuitofGisacircuitsuchthateveryedgeofGisincidentwithatleastonevertexofthecircuit.AgraphofordernispancyclicifitcontainsallcyclesoflengthIfor3515n.IfCisacircuitofG,thenP(C)denotesthenumberOfedgesofGincidentwithatleas…     

完备图分拆为带一条弦的(2k-1)-长圈

本文给出了构造G-设计的一个统一方法及当v≡1(mod 4k)时的C_(2k-1)~((r))-GD(v)的存在性,其中C_(10)~((r)),1≤r≤k-2表示带一条弦的2k-1长圈,r表示弦两个端点间的顶点个数。     

Bounds on Codes Derived by Counting Components in Varshamov Graphs

We are interested in improving the Varshamov bound for finite values of length n and minimum distance d. We employ a counting lemma to this end which we find particularly useful in relation to Varshamov graphs. Since a Varshamov graph consists of components corresponding to low weight vectors in the cosets of a code it is a useful tool when trying to improve the estimates involved in the Varshamov bound. We consider how the graph can be iteratively constructed and using our observations are able to achieve a reduction in the over-counting which occurs. This tightens the lower bound for any choice of parameters n, k, d or q and is not dependent on information such as the weight distribution of a code. This work is taken from the author’s thesis [10]     

具有唯一4度最大度点的图的全色数

一个图Ｇ的全色数χ_T（Ｇ）是使得Ｖ（Ｇ）∪Ｅ（Ｇ）中相邻或相关联元素均染不同颜色的最少颜色数．文中证明了，若图Ｇ只有唯一的一个４度最大度点，则χ_T（Ｇ）＝Δ（Ｇ）＋１．     

Functional Central Limit Theorems for Triangular Arrays of Function-Indexed Processes under Uniformly Integrable Entropy Conditions

Functional central limit theorems for triangular arrays of rowwise independent stochastic processes are established by a method replacing tail probabilities by expectations throughout. The main tool is a maximal inequality based on a preliminary version proved by P. Gaenssler and Th. Schlumprecht. Its essential refinement used here is achieved by an additional inequality due to M. Ledoux and M. Talagrand. The entropy condition emerging in our theorems was introduced by K. S. Alexander, whose functional central limit theorem for so-calledmeasure-like processeswill be also regained. Applications concern, in particular, so-calledrandom measure processeswhich include function-indexed empirical processes and partial-sum processes (with random or fixed locations). In this context, we obtain generalizations of results due to K. S. Alexander, M. A. Arcones, P. Gaenssler, and K. Ziegler. Further examples include nonparametric regression and intensity estimation for spatial Poisson processes.     

Diagrams,orientations, and varieties

One of the central problems in the theory of ordered sets is to describe the orientations of the covering graph of an ordered set. We show that the particular operation called inversion, together with the classical constructions of retraction and product, provide a context for the classification of all such orientations. AMS subject classifications (1980). 06A10, 05C75, 05C20.     

Global Forcing Number of Benzenoid Graphs

A global forcing set in a simple connected graph G with a perfect matching is any subset S of E(G) such that the restriction of the characteristic function of perfect matchings of G on S is an injection. The number of edges in a global forcing set of the smallest cardinality is called the global forcing number of G. In this paper we prove several results concerning global forcing sets and numbers of benzenoid graphs. In particular, we prove that all catacondensed benzenoids and catafused coronoids with n hexagons have the global forcing number equal to n, and that for pericondensed benzenoids the global forcing number is always strictly smaller than the number of hexagons.     

Unicyclic Graphs with Minimal Energy

If G is a graph and ₁,₂,..., _n are its eigenvalues, then the energy of G is defined as E(G)=|₁|+|₂|++| _n |. Let S _n ³ be the graph obtained from the star graph with n vertices by adding an edge. In this paper we prove that S _n ³ is the unique minimal energy graph among all unicyclic graphs with n vertices (n6).     

Pattern of separatrices and intrinsic reaction coordinates for degenerate thermal rearrangements

A structurally stable model of the standard adiabatic gradient field of the potential energy surface for certain pericyclic reactions is derived.These reactions are not subjected to the principles of orbital isomerism or to the Woodward-Hoffmann rules.Use is made of a principle established by Ariel Fernández and Oktay Sinanolu which precludes direct meta-IRC connections between transition states.It is shown that Jahn-Teller isomers of the singlet biradicals involved in the process are not interconvertible since the biradical configuration is not a transition state but a critical point with Hessian matrix with two negative eigenvalues.The topological features of the PES obtained by combinatorial methods are in full agreement with earlier results obtained from MINDO calculations.     

Note on the application of the reduced graph model in conjunction with search trees to the enumeration ofKekulé structures

The reduced graph model, when used in conjunction with the search trees method, provides a novel combinatorial procedure for the enumeration and generation ofKekulé structures. The procedure is suited for large benzenoid hydrocarbons consisting of cata- and thin peri-condensed parts.

---

Zur Anwendung des Reduced Graph Model im Zusammenhang mit Search Trees zur Ermittlung der Anzahl möglicherKekulé-Strukturen

Zusammenfassung Das Modell erlaubt mit der im Titel genannten Kombination eine neuartige Methode zur Ermittlung und Generierung vonKekulé-Strukturen. Das Verfahren ist für große benzoide Kohlenwasserstoffe geeignet, die aus cata- und (dünnen) peri-kondensierten Teilstrukturen bestehen.