Degree sequences of graphs containing a cycle with prescribed length

Let r ≥ 3, n ≥ r and π = (d ₁, d ₂, ..., d _n ) be a non-increasing sequence of nonnegative integers. If π has a realization G with vertex set V (G) = {v ₁, v ₂, ..., v _n } such that d _G (v _i ) = d _i for i = 1, 2, ..., n and v ₁ v ₂ ... v _r v ₁ is a cycle of length r in G, then π is said to be potentially C _r ″-graphic. In this paper, we give a characterization for π to be potentially C _r ″-graphic. This work was supported by the grant of National Natural Science Foundation of China No. 10861006 and China Scholarship Council.     

On Cycle Sequences

. For each vertex v in a graph G, the maximum length of a cycle which passes through v is called the cycle number of v, denoted by c(v). A sequence a ₁,a ₂,…,a _n of nonnegative integers is called a cycle sequence of a graph G if the vertices of G can be labeled as v ₁,v ₂,…,v _n such that a _i =c(v _i ) for 1≤i≤n. We give some sufficient and necessary conditions for a sequence to be a cycle sequence. We can thereby derive a polynomial time procedure for recognizing cycle sequences. Received: July 14, 1997 Final version received: June 15, 1998     

A Note on L（2, 1）-labelling of Trees

An L(2,1)-labelling of a graph G is a function from the vertex set V (G) to the set of all nonnegative integers such that |f(u) f(v)| ≥ 2 if d G (u,v)=1 and |f(u) f(v)| ≥ 1 if d G (u,v)=2.The L(2,1)-labelling problem is to find the smallest number,denoted by λ(G),such that there exists an L(2,1)-labelling function with no label greater than it.In this paper,we study this problem for trees.Our results improve the result of Wang [The L(2,1)-labelling of trees,Discrete Appl.Math.154 (2006) 598-603].     

The Erdös-Jacobson-Lehel conjecture on potentiallyP k-graphic sequence is true

A variation in the classical Turan extrernal problem is studied. A simple graphG of ordern is said to have propertyPk if it contains a clique of sizek+1 as its subgraph. Ann-term nonincreasing nonnegative integer sequence π=(d₁, d₂,⋯, d₂) is said to be graphic if it is the degree sequence of a simple graphG of ordern and such a graphG is referred to as a realization of π. A graphic sequence π is said to be potentiallyP _k-graphic if it has a realizationG having propertyP _k . The problem: determine the smallest positive even number σ(k, n) such that everyn-term graphic sequence π=(d₁, d₂,…, d₂) without zero terms and with degree sum σ(π)=(d ₁+d ₂+ …+d ₂) at least σ(k,n) is potentially P_k-graphic has been proved positive. Project supported by the National Natural Science Foundation of China (Grant No. 19671077) and the Doctoral Program Foundation of National Education Department of China.     

Aggregation in a one-dimensional stochastic gas model with finite polynomial moments of particle speeds

We consider a one-dimensional system of auto-gravitating sticky particles with random initial speeds and describe the process of aggregation in terms of the largest cluster size L_n at any fixed time prior to the critical time. We study the asymptotic behavior of L_n for the warm gas, i.e., for a system of particles with nonzero initial speeds v_i(0) = u_i, where (u_i) is a family of i.i.d. random variables with mean zero, unit variance, and finite pth moment E(|u_i|^p) < ∞, p ≥ 2, and obtain sharp lower and upper bounds for L_n(t). Bibliography: 17 titles. __________ Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 351, 2007, pp. 158–179.     

Degree series of the 3-harmonic graphs

A λ harmonic graph G, a λ-Hgraph G for short, means that there exists a constant λ such that the equality λd（vi） = Σ（vi,vj）∈E（G） d（vj） holds for all i = 1, 2,..., ｜V（G）｜, where d（vi） denotes the degree of vertex vi. Let ni denote the number of vertices with degree i. This paper deals with the 3-Hgraphs and determines their degree series. Moreover, the 3-Hgraphs with bounded ni （1 ≤ i ≤ 7） are studied and some interesting results are obtained.     

The smallest degree sum that yields potentially Kr,r-graphic sequences

We consider a variation of a classical Turán-type extremal problem as follows: Determine the smallest even integer σ(K_r,r,n) such that every n-term graphic sequence π = (d₁,d₂,...,d_n) with term sum σ(π) = d₁ + d₂ + ... + d_n ≥ σ(K_r,r,n) is potentially K_r,r-graphic, where K_r,r is an r × r complete bipartite graph, i.e. π has a realization G containing K_r,r as its subgraph. In this paper, the values σ(K_r,r,n) for even r and n ≥ 4r² - r - 6 and for odd r and n ≥ 4r² + 3r - 8 are determined.     

Refined enumerations of alternating sign matrices: monotone (<Emphasis Type="Italic">d</Emphasis>,<Emphasis Type="Italic">m</Emphasis>)-trapezoids with prescribed top and bottom row

Monotone triangles are plane integer arrays of triangular shape with certain monotonicity conditions along rows and diagonals. Their significance is mainly due to the fact that they correspond to n×n alternating sign matrices when prescribing (1,2,…,n) as bottom row of the array. We define monotone (d,m)-trapezoids as monotone triangles with m rows where the d−1 top rows are removed. (These objects are also equivalent to certain partial alternating sign matrices.) It is known that the number of monotone triangles with bottom row (k ₁,…,k _n ) is given by a polynomial α(n;k ₁,…,k _n ) in the k _i ’s. The main purpose of this paper is to show that the number of monotone (d,m)-trapezoids with prescribed top and bottom row appears as a coefficient in the expansion of a specialisation of α(n;k ₁,…,k _n ) with respect to a certain polynomial basis. This settles a generalisation of a recent conjecture of Romik et al. (Adv. Math. 222:2004–2035, 2009). Among other things, the result is used to express the number of monotone triangles with bottom row (1,2,…,i−1,i+1,…,j−1,j+1,…,n) (which is, by the standard bijection, also the number of n×n alternating sign matrices with given top two rows) in terms of the number of n×n alternating sign matrices with prescribed top and bottom row, and, by a formula of Stroganov for the latter numbers, to provide an explicit formula for the first numbers. (A formula of this type was first derived by Karklinsky and Romik using the relation of alternating sign matrices to the six-vertex model.)     

On λ-harmonic graphs

A λ harmonic graph G, a λ-Hgraph G for short, means that there exists a constant A such that the equality λd（ui） = ∑（vi,vj）∈E（G） d（vj） holds for all i = 1, 2,…, ｜V（G）｜, where d（vi） denotes the degree of vertex vi. In this paper, some harmonic properties of the complement and line graph are given, and some algebraic properties for the λ-Hgraphs are obtained.     

On linear forms whose coefficients are in arithmetic progression

Let Ω be the set of positive integers that are omitted values of the form where thea _i are fixed positive integers with g.c.d. 1 and thex _i are variable nonnegative integers. Set ω=|Ω| and κ=max Ω+1. Using an expression of Roberts [4] for κ when thea _i form an arithmetic progression, we determine ω in this case.     

Weights andL Φ-boundedness of the Poisson integral operator

In this paper, we get a necessary and sufficient condition on the weights (μ,v) for the Poisson integral operator to be bounded fromL _Φ(R ⁿ, v(x)dx) to weak-L _Φ(R ₊ ⁿ⁺¹ ,dμ), where Φ is anN-function satisfying the Δ₂-condition. We also find a necessary and sufficient condition on the weights (μ,v) for the Poisson integral operator to be bounded fromL _Φ(R ⁿ,v(x)dx) toL _Φ(R ₊ ⁿ⁺¹ ,dμ) under some additional condition. Partially supported by NNSF of P.R. China     

Construction of a Maximally Edge-Connected Graph with Prescribed Degrees

Let 〈d₁,d₂,...,d_p,〉 be a realizable degree sequence, d_i?2; then a graph G can be constructed so that deg(v_i and so that for i≠j, the number of edge-disjoint paths between v_i and v_j is (d_i,d_j).     

Some results on the majorization theorem of connected graphs

Let π = (d ₁, d ₂, ..., d _n ) and π′ = (d′ ₁, d′ ₂, ..., d′ _n ) be two non-increasing degree sequences. We say π is majorizated by π′, denoted by π ⊲ π′, if and only if π ≠ π′, Σ _i=1 ⁿ d _i = Σ _i=1 ⁿ d′ _i , and Σ _i=1 ^j d _i ≤ Σ _i=1 ^j d′ _i for all j = 1, 2, ..., n. Weuse C _π to denote the class of connected graphs with degree sequence π. Let ρ(G) be the spectral radius, i.e., the largest eigenvalue of the adjacent matrix of G. In this paper, we extend the main results of [Liu, M. H., Liu, B. L., You, Z. F.: The majorization theorem of connected graphs. Linear Algebra Appl., 431(1), 553–557 (2009)] and [Bıyıkoğlu, T., Leydold, J.: Graphs with given degree sequence and maximal spectral radius. Electron. J. Combin., 15(1), R119 (2008)]. Moreover, we prove that if π and π′ are two different non-increasing degree sequences of unicyclic graphs with π ⊲ π′, G and G′ are the unicyclic graphs with the greatest spectral radii in C _π and C′ _π , respectively, then ρ(G) < ρ(G′).     

Kernels of derivations of polynomial rings and Casimir elements

We propose an algorithm for the evaluation of elements of the kernel of an arbitrary derivation of a polynomial ring. The algorithm is based on an analog of the well-known Casimir element of a finite-dimensional Lie algebra. By using this algorithm, we compute the kernels of Weitzenb?ck derivation d(x _i ) = x _i−1, d(x ₀) = 0, i = 0,…, n, for the cases where n ≤ 6.     

A superadditivity and submultiplicativity property for cardinalities of sumsets

For finite sets of integers A ₁,…,A _n we study the cardinality of the n-fold sumset A ₁+…+ A _n compared to those of (n−1)-fold sumsets A ₁+…+A _i−1+A _i+1+…+A _n . We prove a superadditivity and a submultiplicativity property for these quantities. We also examine the case when the addition of elements is restricted to an addition graph between the sets.     

Greedy Drawings of Triangulations

Greedy Routing is a class of routing algorithms in which the packets are forwarded in a manner that reduces the distance to the destination at every step. In an attempt to provide theoretical guarantees for a class of greedy routing algorithms, Papadimitriou and Ratajczak (Theor. Comput. Sci. 344(1):3–14, 2005) came up with the following conjecture:

Any 3-connected planar graph can be drawn in the plane such that for every pair of vertices s and t a distance decreasing path can be found. A path s=v ₁,v ₂,…,v _k =t in a drawing is said to be distance decreasing if ‖v _i −t‖<‖v _i−1−t‖,2≤i≤k where ‖…‖ denotes the Euclidean distance.

We settle this conjecture in the affirmative for the case of triangulations.     

The increase of sums and products dependent on (y 1, …,y n ) by rearrangement of this set

LetF(u, v) be a symmetric real function defined forα<u, v<β and assume thatG(u, v, w)=F(u, v)+F(u, w)−F(v, w) is decreasing inv andw foru≦min (u, v). For any set (y)=(y ₁, …,y _n ),α<y _i <β, given except in arrangement Σ _i ^=1/n F(y _i ,y _i+1) wherey _n+1=y ₁) is maximal if (and under some additional assumptions only if) (y) is arranged in circular symmetrical order. Examples are given and an additional result is proved on the productΠ _i ^=1/n [(y2i−1y2i) ^m +α ₁(y _2i−1 y _2i ) ^m−1+ … +a _m ] wherea _k ≧0 and where the set (y)=(y ₁, ..,y _n ),y _i ≧0 is given except in arrangement. The problems considered here arose in connection with a theorem by A. Lehman [1] and a lemma of Duffin and Schaeffer [2]. This paper is part of the author’s Master of Science dissertation at the Technion-Israel Institute of Technology. The author wishes to thank Professor B. Schwarz and Professor E. Jabotinsky for their help in the preparation of this paper.     

On the local distribution of certain arithmetic functions

Let d(n), σ ₁(n), and φ(n) stand for the number of positive divisors of n, the sum of the positive divisors of n, and Euler’s function, respectively. For each ν ∈, Z, we obtain asymptotic formulas for the number of integers n ⩽ x for which e _n = 2 ^v r for some odd integer m as well as for the number of integers n ⩽ x for which e _n = 2 ^v r for some odd rational number r. Our method also applies when φ(n) is replaced by σ ₁(n), thus, improving upon an earlier result of Bateman, Erdős, Pomerance, and Straus, according to which the set of integers n such that is an integer is of density 1/2. Research supported in part by a grant from NSERC. Research supported by the Applied Number Theory Research Group of the Hungarian Academy of Science and by a grant from OTKA. Published in Lietuvos Matematikos Rinkinys, Vol. 46, No. 3, pp. 315–331, July–September, 2006.     

Ascents of size less than <Emphasis Type="Italic">d</Emphasis> in compositions

A composition of a positive integer n is a finite sequence π₁π₂...π _m of positive integers such that π₁+...+π _m = n. Let d be a fixed number. We say that we have an ascent of size d or more (respectively, less than d) if π _i+1 ≥ π _i +d (respectively, π _i < π _i+1 < π _i + d). Recently, Brennan and Knopfmacher determined the mean, variance and limiting distribution of the number of ascents of size d or more in the set of compositions of n. In this paper, we find an explicit formula for the multi-variable generating function for the number of compositions of n according to the number of parts, ascents of size d or more, ascents of size less than d, descents and levels. Also, we extend the results of Brennan and Knopfmacher to the case of ascents of size less than d. More precisely, we determine the mean, variance and limiting distribution of the number of ascents of size less than d in the set of compositions of n.