Super-connectivity and super-edge-connectivity for some interconnection networks

Let G=(V,E) be a k-regular graph with connectivity κ and edge connectivity λ. G is maximum connected if κ=k, and G is maximum edge connected if λ=k. Moreover, G is super-connected if it is a complete graph, or it is maximum connected and every minimum vertex cut is {x|(v,x)E} for some vertex vV; and G is super-edge-connected if it is maximum edge connected and every minimum edge disconnecting set is {(v,x)|(v,x)E} for some vertex vV. In this paper, we present three schemes for constructing graphs that are super-connected and super-edge-connected. Applying these construction schemes, we can easily discuss the super-connected property and the super-edge-connected property of hypercubes, twisted cubes, crossed cubes, möbius cubes, split-stars, and recursive circulant graphs.     

Hamiltonian cycles in -circulant digraphs

Let D be the circulant digraph with n vertices and connection set {2,3,c}. (Assume D is loopless and has outdegree 3.) Work of S. C. Locke and D. Witte implies that if n is a multiple of 6, c{(n/2)+2,(n/2)+3}, and c is even, then D does not have a hamiltonian cycle. For all other cases, we construct a hamiltonian cycle in D.     

Stochastic convergence of weighted sums in normed linear spaces

Let X be a (real) separable Banach space, let {V_k} be a sequence of random elements in X, and let {a_nk} be a double array of real numbers such that lim_n→∞ a_nk = 0 for all k and Σ^∞_k=1 |a_nk| ≤ 1 for all n. Define S_n = Σⁿ_k=1 a_nk(V_k − EV_k). The convergence of {S_n} to zero in probability is proved under conditions on the coordinates of a Schauder basis or on the dual space of X and conditions on the distributions of {V_k}. Convergence with probability one for {S_n} is proved for separable normed linear spaces which satisfy Beck's convexity condition with additional restrictions on {a_nk} but without distribution conditions for the random elements {V_k}. Finally, examples of arrays {a_nk}, spaces, and applications of these results are considered.     

THE EDGE-CHROHATIC NUMBER OF A CIRCULANT

ABSTRACT

The circulant graph C_p > a₁,…, a_k < with 0 > a₁ >…> a_k >(pt1)/2 has p vertices labeled 0,1,…,p-1 and x and y are adjacent if and only if x—y = ± a_i (mod p) for some i. We prove the following regarding the chromatic index of a circulant: if d = gcd (a₁,…, a_k, p), then x' (C_p > a_l,…,a_k) = Δ(C p > a₁,…,a_k) if and only if p/d is even.     

On consecutive edge magic total labeling of graphs

Let G=(V,E) be a finite (non-empty) graph, where V and E are the sets of vertices and edges of G. An edge magic total labeling is a bijection α from VE to the integers 1,2,…,n+e, with the property that for every xyE, α(x)+α(y)+α(xy)=k, for some constant k. Such a labeling is called an a-vertex consecutive edge magic total labeling if α(V)={a+1,…,a+n} and a b-edge consecutive edge magic total if α(E)={b+1,b+2,…,b+e}. In this paper we study the properties of a-vertex consecutive edge magic and b-edge consecutive edge magic graphs.     

Extremal problems concerning Kneser graphs

Let and be two intersecting families of k-subsets of an n-element set. It is proven that | | ≤ (_k−1ⁿ⁻¹) + (_k−1ⁿ⁻¹) holds for , and equality holds only if there exist two points a, b such that {a, b} ∩ F ≠ for all F . For an example showing that in this case max | | = (1−o(1))(_kⁿ) is given. This disproves an old conjecture of Erdös [7]. In the second part we deal with several generalizations of Kneser's conjecture.     

Coloring of distance graphs with intervals as distance sets

Let D be a set of positive integers. The distance graph G(Z,D) with distance set D is the graph with vertex set Z in which two vertices x,y are adjacent if and only if |x−y|D. The fractional chromatic number, the chromatic number, and the circular chromatic number of G(Z,D) for various D have been extensively studied recently. In this paper, we investigate the fractional chromatic number, the chromatic number, and the circular chromatic number of the distance graphs with the distance sets of the form D_m,[k,k^′]={1,2,…,m}−{k,k+1,…,k^′}, where m, k, and k^′ are natural numbers with m≥k^′≥k. In particular, we completely determine the chromatic number of G(Z,D_m,[2,k^′]) for arbitrary m, and k^′.     

Hamilton cycles in circulant digraphs with prescribed number of distinct jumps

Let G be a digraph that consists of a finite set of vertices V(G). G is called a circulant digraph if its automorphism group contains a |V(G)|-cycle. A circulant digraph G has arcs incident to each vertex i, where integers a_ks satisfy 0<a₁<a₂<a_j≤|V(G)|−1 and are called jumps. It is well known that not every G is Hamiltonian. In this paper we give sufficient conditions for a G to have a Hamilton cycle with prescribed distinct jumps, and prove that such conditions are also necessary for every G with two distinct jumps. Finally, we derive several results for obtaining G^′ with k, k≥2 distinct jumps if the corresponding G contains a Hamilton cycle with two distinct jumps.     

A new method for constructing infinite families of k-tight optimal double loop networks

The double loop network (DLN) is a circulant digraph with n nodes and outdegree 2. DLN has been widely used in the designing of local area networks and distributed systems. In this paper, a new method for constructing infinite families of k-tight optimal DLN is presented. For k = 0, 1, ..., 40, the infinite families of k-tight optimal DLN can be constructed by the new method, where the number n _k (t, a) of their nodes is a polynomial of degree 2 in t and contains a parameter a. And a conjecture is proposed.     

On product representations of powers, I

The solvability of the equation a₁a₂ … a_k = x², a₁, a₂, …, a_k ε is studied for fixed k and ‘dense’ sets of positive integers. In particular, it is shown that if k is even and k 4, and is of positive upper density, then this equation can be solved.     

Rado Numbers fora(x+y)=bz

In the case of existence the smallest numberN=Ra_kis called a Rado number if it is guaranteed that anyk-coloring of the numbers 1, 2, …, Ncontains a monochromatic solution of a given system of linear equations. We will determine Ra_k(a, b) for the equationa(x+y)=bzifb=2 andb=a+1. Also, the case of monochromatic sequences {x_n} generated bya(x_n+x_n+1)=bx_n+2 is discussed.     

The energy of unitary cayley graphs

A graph G of order n is called hyperenergetic if E(G)>2n-2, where E(G) denotes the energy of G. The unitary Cayley graph X_n has vertex set Z_n={0,1,2,…,n-1} and vertices a and b are adjacent, if gcd(a-b,n)=1. These graphs have integral spectrum and play an important role in modeling quantum spin networks supporting the perfect state transfer. We show that the unitary Cayley graph X_n is hyperenergetic if and only if n has at least two prime factors greater than 2 or at least three distinct prime factors. In addition, we calculate the energy of the complement of unitary Cayley graph and prove that is hyperenergetic if and only if n has at least two distinct prime factors and n≠2p, where p is a prime number. By extending this approach, for every fixed , we construct families of k hyperenergetic non-cospectral integral circulant n-vertex graphs with equal energy.     

Completeness of Orthonormal Wavelet Systems for Arbitrary Real Dilations

It is shown that the discrete Calderón condition characterizes completeness of orthonormal wavelet systems, for arbitrary real dilations. That is, if a>1,b>0, and the system Ψ={a^j/2ψ(a^jx−bk):j,k } is orthonormal in L²( ), then Ψ is a basis for L²( ) if and only if ∑_j | (a^jξ)|²=b for almost every ξ . A new proof of the Second Oversampling Theorem is found, by similar methods.     

Density of Gabor Frames

A Gabor system is a set of time-frequency shifts S(g, Λ) ={e^{2 π ibx}g(x − a)}_{(a, b) Λ} of a function g L²(R^d). We prove that if a finite union of Gabor systems _{k = 1}^rS(g_k, Λ_k) forms a frame for L²(R^d) then the lower and upper Beurling densities of Λ = _{k = 1}^r Λ_k satisfy D⁻(Λ) ≥ 1 and D ⁺ (Λ) < ∞. This extends recent work of Ramanathan and Steger. Additionally, we prove the conjecture that no collection _{k = 1}^r{g_k(x − a)}_{a Γk} of pure translates can form a frame for L²(R^d).     

An inverse theorem for the restricted set addition in Abelian groups

Let A be a set of k5 elements of an Abelian group G in which the order of the smallest nonzero subgroup is larger than 2k−3. Then the number of different elements of G that can be written in the form a+a^′, where a,a^′A, a≠a^′, is at least 2k−3, as it has been shown in [Gy. Károlyi, The Erdős–Heilbronn problem in Abelian groups, Israel J. Math. 139 (2004) 349–359]. Here we prove that the bound is attained if and only if the elements of A form an arithmetic progression in G, thus completing the solution of a problem of Erdős and Heilbronn. The proof is based on the so-called ‘Combinatorial Nullstellensatz.’     

Properties of digraphs connected with some congruence relations

The paper extends the results given by M. Křížek and L. Somer, On a connection of number theory with graph theory, Czech. Math. J. 54 (129) (2004), 465–485 (see [5]). For each positive integer n define a digraph Γ(n) whose set of vertices is the set H = {0, 1, ..., n − 1} and for which there is a directed edge from a ∈ H to b ∈ H if a ³ ≡ b (mod n). The properties of such digraphs are considered. The necessary and the sufficient condition for the symmetry of a digraph Γ(n) is proved. The formula for the number of fixed points of Γ(n) is established. Moreover, some connection of the length of cycles with the Carmichael λ-function is presented.      

On a conjecture of J. Pelikán

There exist infinitely many finite sequences (a₁, …, a_n) (a_i {0, 1}) such that Φ_{i = 1}^{n − k} a_ia_{i + k} is odd for each k = 0, 1, …, n − 1.     

The structure of digraphs associated with the congruence <Emphasis Type="Italic">x</Emphasis><Superscript><Emphasis Type="Italic">k</Emphasis></Superscript> ≡ <Emphasis Type="Italic">y</Emphasis> (mod <Emphasis Type="Italic">n</Emphasis>)

We assign to each pair of positive integers n and k ⩾ 2 a digraph G(n, k) whose set of vertices is H = {0, 1, ..., n − 1} and for which there is a directed edge from a ∈ H to b ∈ H if a ^k ≡ b (mod n). We investigate the structure of G(n, k). In particular, upper bounds are given for the longest cycle in G(n, k). We find subdigraphs of G(n, k), called fundamental constituents of G(n, k), for which all trees attached to cycle vertices are isomorphic.     

On almost sure convergence of Cesaro averages of subsequences of vector-valued functions

A remarkable theorem proved by Komlòs [4] states that if {f_n} is a bounded sequence in L¹(R), then there exists a subsequence {f_nk} and f L¹(R) such that f_nk (as well as any further subsequence) converges Cesaro to f almost everywhere. A similar theorem due to Révész [6] states that if {f_n} is a bounded sequence in L²(R), then there is a subsequence {f_nk} and f L²(R) such that Σ_k=1^∞ a_k(f_nk − f) converges a.e. whenever Σ_k=1^∞ | a_k |² < ∞. In this paper, we generalize these two theorems to functions with values in a Hilbert space (Theorems 3.1 and 3.3).     

Extremal values of continuants and transcendence of certain continued fractions

We prove a criterion for the transcendence of continued fractions whose partial quotients are contained in a finite set {b₁,…,b_r} of positive integers such that the density of occurrences of b_i in the sequence of partial quotients exists for 1ir. As an application we study continued fractions [0,a₁,a₂,a₃,…] with a_n=1+([nθ]modd) where θ is irrational and d2 is a positive integer.