FORCING BONDS OF A BENZENOID SYSTEM

ＦＯＲＣＩＮＧＢＯＮＤＳＯＦＡＢＥＮＺＥＮＯＩＤＳＹＳＴＥＭＺＨＡＮＧＦＵＪＩ（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＸｉａｍｅｎＵｎｉｖｅｒｓｉｔｙ，Ｘｉａｍｅｎ８５００４６，Ｃｈｉｎａ）ＬＩＸＵＥＬＩＡＮＧ（ＤｅｐａｒｔｍｅｎｔｏｆＡｐ...     

ADMISSIBILITY OF LINEAR ESTIMATE OF REGRESSION COEFFICIENTS IN GROWTH CURVE MODEL UNDER MATRIX LOSS

ＡＤＭＩＳＳＩＢＩＬＩＴＹＯＦＬＩＮＥＡＲＥＳＴＩＭＡＴＥＯＦＲＥＧＲＥＳＳＩＯＮＣＯＥＦＦＩＣＩＥＮＴＳＩＮＧＲＯＷＴＨＣＵＲＶＥＭＯＤＥＬＵＮＤＥＲＭＡＴＲＩＸＬＯＳＳＷＡＮＧＸＵＥＲＥＮ（王学仁）（ＤｅｐａｒｔｍｅｎｔｏｆＳｔａｔｉｓｔｉｃｓ，...     

TURNING POINT PROBLEMS FOR THE THIRD ORDER DIFFERENTIAL EQUATIONS EXHIBITING RESONANCE

ＴＵＲＮＩＮＧＰＯＩＮＴＰＲＯＢＬＥＭＳＦＯＲＴＨＥＴＨＩＲＤＯＲＤＥＲＤＩＦＦＥＲＥＮＴＩＡＬＥＱＵＡＴＩＯＮＳＥＸＨＩＢＩＴＩＮＧＲＥＳＯＮＡＮＣＥＸＩＡＯＣＨＥＮＧＹＯＵ（肖成猷）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＥａｓｔＣｈｉ...     

USING FINITE GEOMETRIES TO CONSTRUCT 3-PBIB(2) DESIGNS AND 3-DESIGNS

ＵＳＩＮＧＦＩＮＩＴＥＧＥＯＭＥＴＲＩＥＳＴＯＣＯＮＳＴＲＵＣＴ３－ＰＢＩＢ（２）ＤＥＳＩＧＮＳＡＮＤ３－ＤＥＳＩＧＮＳ￥ＹＡＮＧＢＥＮＦＵ（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＣｈｅｎｇｄｕＴｅａｃｈｅｒｓＣｏｌｌｅｇｅ，Ｃｈｅｎｇｄｕ...     

PACKING PAIRS BY QUINTUPLES:THE CASE OF ZERO CONGRUENCE MOD 4

ＰＡＣＫＩＮＧＰＡＩＲＳＢＹＱＵＩＮＴＵＰＬＥＳ：ＴＨＥＣＡＳＥＯＦＺＥＲＯＣＯＮＧＲＵＥＮＣＥＭＯＤ４ＹＩＮＪＩＡＮＸＩＮＧＡｂｓｔｒａｃｔ：ＬｅｔＤ（ｖ）ｄｅｎｏｔｅｔｈｅｍａｘｉｍｕｍｎｕｍｂｅｒｏｆｑｕｉｎｔｕｐｌｅｓｏｆａｖ－ｓｅｔｏｆｐｏ...     

A NEW DETECTING METHOD FOR CONDITIONS OF EXISTENCE OF HOPF BIFURCATION

ＡＮＥＷＤＥＴＥＣＴＩＮＧＭＥＴＨＯＤＦＯＲＣＯＮＤＩＴＩＯＮＳＯＦＥＸＩＳＴＥＮＣＥＯＦＨＯＰＦＢＩＦＵＲＣＡＴＩＯＮＳＨＥＮＪＩＡＱＩ（沈家骐）；ＪＩＮＧＺＨＵＪＵＮ（井竹君）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＳｈａｎｄｏｎｇＵｎ...     

COMPLETE EXTREMAL SURFACES OF MIXED TYPE IN 3-DIMENSIONAL MINKOWSKI SPACE

ＣＯＭＰＬＥＴＥＥＸＴＲＥＭＡＬＳＵＲＦＡＣＥＳＯＦＭＩＸＥＤＴＹＰＥＩＮ３－ＤＩＭＥＮＳＩＯＮＡＬＭＩＮＫＯＷＳＫＩＳＰＡＣＥ￥ＧＵＣＨＡＯＨＡＯ（ＩｎｓｔｉｔｕｔｅｏｆＭａｔｈｅｍａｔｉｃｓ，ＦｕｄａｎＵｎｉｖｅｒｓｉｔｙ，Ｓｈａｎｇｈａｉ２００...     

A SUCCESSIVE APPROXIMATION METHOD FOR SOLVING PROBABILISTIC CONSTRAINED PROGRAMS

ＡＳＵＣＣＥＳＳＩＶＥＡＰＰＲＯＸＩＭＡＴＩＯＮＭＥＴＨＯＤＦＯＲＳＯＬＶＩＮＧＰＲＯＢＡＢＩＬＩＳＴＩＣＣＯＮＳＴＲＡＩＮＥＤＰＲＯＧＲＡＭＳＷＡＮＧＪＩＮＤＥ（王金德）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＮａｎｊｉｎｇＵｎｉｖｅｒｓ...     

A randomly weighted estimate of the population mean

ＡＲＡＮＤＯＭＬＹＷＥＩＧＨＴＥＤＥＳＴＩＭＡＴＥＯＦＴＨＥＰＯＰＵＬＡＴＩＯＮ　ＭＥＡＮＣＨＥＮＸＩＲＵ（陈希孺）ＪＩＮＭＩＮＧＺＨＯＮＧ（金明仲）（ＧｒａｄｕａｔｅＳｃｈｏｏｌ,ＵｎｉｖｅｒｓｉｔｙｏｆＳｃｉｅｎｃｅａｎｄＴｅｃｈｎｏｌａｐｙｏｆ...     

STRONGLY ALGEBRAIC LATTICES AND CONDITIONS OF MINIMAL MAPPING PRESERVING INFS

ＳＴＲＯＮＧＬＹ ＡＬＧＥＢＲＡＩＣ ＬＡＴＴＩＣＥＳ ＡＮＤ ＣＯＮＤＩＴＩＯＮＳ ＯＦ ＭＩＮＩＭＡＬ ＭＡＰＰＩＮＧ ＰＲＥＳＥＲＶＩＮＧ ＩＮＦＳ ￥ＸＵＸＩＡＯＱＵＡＮＡｂｓｔｒａｃｔ：Ｔｈｅｔａｂｏｒｇｉｖｅｓｓｏｍｅｃｈａｒａｃｔｅｒｉ...     

Well-covered circulant graphs

A graph is well-covered if every independent set can be extended to a maximum independent set. We show that it is co-NP-complete to determine whether an arbitrary graph is well-covered, even when restricted to the family of circulant graphs. Despite the intractability of characterizing the complete set of well-covered circulant graphs, we apply the theory of independence polynomials to show that several families of circulants are indeed well-covered. Since the lexicographic product of two well-covered circulants is also a well-covered circulant, our partial characterization theorems enable us to generate infinitely many families of well-covered circulants previously unknown in the literature.     

On inverting circulant matrices

The elements of the inverse of a circulant matrix having only three non-zero elements in each row (located in cyclically adjacent columns) are derived analytically from the solution of a recurrence equation. Expressing any circulant as a product containing these three-element-type circulants then provides an algorithm for inverting circulants in general. Extension is also made to deriving generalized inverses of certain singular circulants.     

Generalized inverses of circulant and generalized circulant matrices

An expression for the Moore-Penrose inverse of certain singular circulants by S.R. Searle is generalized to include all circulants. Similar expressions are given for the Moore-Penrose inverse of block circulants with circulant blocks, level-q circulants, k-circulants where |k|=1, and certain other matrices which are the product of a permutation matrix and a circulant. Expressions for other generalized inverses are given.     

PRODUCTS OF CIRCULANT GRAPHS

ABSTRACT

Graph products of circulants are studied. It is shown that if G and H are circulants and gcd(v(G), v(H)) = 1, then every B-product of G and H is again a circulant. We prove that if m ≠ 2, then the generalised prism K₂ ^mxC_n is a circulant iff n is odd. A similar result is deduced for the conjunction. We also prove that C_p x C_q is a circulant iff p and q are relatively prime. We close by showing that the composition of two circulants is again a circulant and explicitly describe the resultant circulant's jump sequence in terms of the constituent circulants' jump sequences.     

Circulant digraphs determined by their spectra

Inspired by Ádám's conjecture the isomorphism problem of circulant digraphs is widely investigated. In the literature, the spectrum method was to solve the isomorphism problem for the circulants of prime-power order by some people. In this paper, we develop the spectrum method to characterize the circulant digraphs of orders p^a and p^aq^b, where p and q are distinct primes.     

Some Identities for Enumerators of Circulant Graphs

We establish analytically several new identities connecting enumerators of different types of circulant graphs mainly of prime, twice prime and prime-squared orders. In particular, it is shown that the half-sum of the number of undirected circulants and the number of undirected self-complementary circulants of prime order is equal to the number of directed self-complementary circulants of the same order. Several identities hold only for prime orders p such that (p + 1)/2 is also prime. Some conjectured generalizations and interpretations are discussed.     

Infinite Circulant Digraphs and Random Infinite Circulant Digraphs

In this paper, we completely determine the connectivity of every infinite circulant digraphs and prove that almost all infinite circulant digraphs are infinitely strongly connected and therefore have both one- and two-way infinite Hamiltonian paths. Received February 4, 1998, Accepted May 16, 2002     

New Infinite Classes of Orthogonal Designs

In this paper we use some results on weighing matrices W (2 n ,9) constructed using two circulants to obtain infinite classes of orthogonal designs. We also present a method that is used to construct two directed sequences of length n and specific type. We apply this method to W (2 n , 9) and we obtain many new pairs of directed sequences of length n and type $(9 \cdot 2^m,9 \cdot 2^m), \ m=0,1,2,3.$ Using these directed sequences we can obtain many new infinite classes of weighing matrices W (2 n , k ), and orthogonal designs OD (2 n ; a,b) constructed from two circulants.     

Normal cirulant graphs with noncyclic regular subroups

We prove that any circulant graph of order n with connection set S such that n and the order of ?(S), the subgroup of ? that fixes S set‐wise, are relatively prime, is also a Cayley graph on some noncyclic group, and shows that the converse does not hold in general. In the special case of normal circulants whose order is not divisible by 4, we classify all such graphs that are also Cayley graphs of a noncyclic group, and show that the noncyclic group must be metacyclic, generated by two cyclic groups whose orders are relatively prime. We construct an infinite family of normal circulants whose order is divisible by 4 that are also normal Cayley graphs on dihedral and noncyclic abelian groups. © 2005 Wiley Periodicals, Inc. J Graph Theory