Supereulerian Digraphs with Large Arc‐Strong Connectivity

Let D be a digraph and let be the arc‐strong connectivity of D, and be the size of a maximum matching of D. We proved that if , then D has a spanning eulerian subdigraph.     

Packing Countably Many Branchings with Prescribed Root‐Sets in Infinite Digraphs

We generalize an unpublished result of C. Thomassen. Let be a digraph and let be a multiset of subsets of V in such a way that any backward‐infinite path in D meets all the sets . We show that if all is simultaneously reachable from the sets by edge‐disjoint paths, then there exists a system of edge‐disjoint spanning branchings in D where the root‐set of is .     

围长为2的本原极小强连通有向图的1-指数集

本文研究了围长为2的本原极小强连通有向图的1-指数，证明了：当n为偶数时{4，5，7，8，9，11，…，2n-7，2n-5，2n-4}真包含 En（1）。     

n阶本原极小强连通有向图k-指数的最小值

本文证明了:当1≤k≤︱n/4︱时,n阶本原极小强连通有向图k指数的最小值是4。     

The Twin Domination Numb er of Strong Pro duct of Digraphs

Let γ*(D) denote the twin domination number of digraph D and let D_1  D_2 denote the strong product of D_1 and D_2. In this paper, we obtain that the twin domination number of strong product of two directed cycles of length at least 2.Furthermore, we give a lower bound of the twin domination number of strong product of two digraphs, and prove that the twin domination number of strong product of the complete digraph and any digraph D equals the twin domination number of D.     

本原极小强连通有向图1—指数的下界

本文给出了n阶本原极小强连通有向图1-指数的下图:expD(1)4.且这个下界是可以达到的.     

On Strong Inclusions and Asymmetric Proximities in Frames

The strong inclusion, a specific type of subrelation of the order of a lattice with pseudocomplements, has been used in the concrete case of the lattice of open sets in topology for an expedient definition of proximity, and allowed for a natural pointfree extension of this concept. A modification of a strong inclusion for biframes then provided a pointfree model also for the non-symmetric variant. In this paper we show that a strong inclusion can be non-symmetrically modified to work directly on frames, without prior assumption of a biframe structure. The category of quasi-proximal frames thus obtained is shown to be concretely isomorphic with the biframe based one, and shown to be related to that of quasi-uniform frames in a full analogy with the symmetric case.     

Digraphs with real and gaussian spectra

The conventional binary operations of cartesian product, conjunction, and composition of two digraphs D₁ and D₂ are observed to give the sum, the product, and a more complicated combination of the spectra of D₁ and D₂ as the resulting spectrum. These formulas for analyzing the spectrum of a digraph are utilized to construct for any positive integer n, a collection of n nonisomorphic strong regular nonsymmetric digraphs with real spectra. Further, an infinite collection of strong nonsymmetric digraphs with nonzero gaussian integer value is found. Finally, for any n, it is shown that there are n cospectral strong nonsymmetric digraphs with integral spectra.     

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     

Digraphs with the path-merging property

In this paper we study those digraphs D for which every pair of internally disjoint (X, Y)-paths P₁, P₂ can be merged into one (X, Y)-path P* such that V(P₁) ∪ V(P₂), for every choice of vertices X, Y ? V(D). We call this property the path-merging property and we call a graph path-mergeable if it has the path-merging property. We show that each such digraph has a directed hamiltonian cycle whenever it can possibly have one, i.e., it is strong and the underlying graph has no cutvertex. We show that path-mergeable digraphs can be recognized in polynomial time and we give examples of large classes of such digraphs which are not contained in any previously studied class of digraphs. We also discuss which undirected graphs have path-mergeable digraph orientations. © 1995, John Wiley & Sons, Inc.     

Constructing Cospectral Digraphs with Arbitrary Centers

The center of graphs and digraphs have long been a topic of interest, as is establishing bounds on graph parameters using the spectrum of the graph. It may be that the spectrum of a digraph has some relationship with the center of the digraph. This turns out not to be the case. A construction is presented that yields cospectral digraphs with arbitrary centers.     

Maps with Prescribed Boardman Singularities

Doklady Mathematics - In this paper we extend Y. Eliashberg’s theorem on the maps with fold type singularities to arbitrary Thom-Boardman singularities. Namely, we state a necessary and...     

Domains with Prescribed Automorphism Group

Let G be the automorphism group of a bounded strictly pseudoconvex domain D⊂ℂ ^N with a smooth ( C^￥\mathcal{C}^{\infty} ) boundary. Let H be a closed subgroup of G. Pertaining to the question whether it is possible to realize H as the automorphism group of a strictly pseudoconvex domain D′ which is an arbitrarily small perturbation of D in C^￥\mathcal{C}^{\infty} topology, we give a partial answer by describing sufficient conditions for D and G.     

Greedy Algorithms with Prescribed Coefficients

We study greedy algorithms in a Banach space from the point of view of convergence and rate of convergence. We concentrate on studying algorithms that provide expansions into a series. We call such expansions greedy expansions. It was pointed out in our previous article that there is a great flexibility in choosing coefficients of greedy expansions. In that article this flexibility was used for constructing a greedy expansion that converges in any uniformly smooth Banach space. In this article we push the flexibility in choosing the coefficients of greedy expansions to the extreme. We make these coefficients independent of an element f ∈ X. Surprisingly, for a properly chosen sequence of coefficients we obtain results similar to the previous results on greedy expansions when the coefficients were determined by an element f.     

Coloring Quasicrystals with Prescribed Symmetries and Frequencies

We show how to color the tiles in a heirarchical tiling system so that the resulting system is not only repetitive (i.e., has the local isomorphism property) but has prescribed color symmetries as well. Received March 9, 1998, and in revised form August 3, 1998.     

顺序和顺序哈密顿有向图

A digraph D is k-ordered if for every sequence S:v 1,v 2,…,v k of k distinct vertices,there exists a cycle C such that C encounters the vertices of S in the specified order.In particular,we say that D is k-ordered hamiltonian if for every sequence S:v 1,v 2,…,v k of k distinct vertices,there exists a hamiltonian cycle C such that the vertices of S are encountered on C in the specified order.In this paper,sufficient conditions for digraphs to be ordered and ordered hamiltonian have been given.     

Digraphs with at most one trivial critical ideal

Critical ideals generalize the critical group, Smith group and the characteristic polynomials of the adjacency and Laplacian matrices of a graph. We give a complete characterization of the digraphs with at most one trivial critical ideal. Which implies the characterizations of the digraphs whose critical group has one invariant factor equal to one, and the digraphs whose Smith group has one invariant factor equal to one.