The effect on the algebraic connectivity of a tree by grafting or collapsing of edges

Let G=(V,E) be a tree on n?2 vertices and let v∈V. Let L(G) be the Laplacian matrix of G and μ(G) be its algebraic connectivity. Let G_k,l, be the graph obtained from G by attaching two new paths P:vv₁v₂…v_k and Q:vu₁u₂…u_l of length k and l, respectively, at v. We prove that if l?k?1 then μ(G_k-1,l+1)?μ(G_k,l). Let (v₁,v₂) be an edge of G. Let be the tree obtained from G by deleting the edge (v₁,v₂) and identifying the vertices v₁ and v₂. Then we prove that As a corollary to the above results, we obtain the celebrated theorem on algebraic connectivity which states that among all trees on n vertices, the path has the smallest and the star has the largest algebraic connectivity.     

Distorsion des distances dans les groupes de Lie nilpotents

Let G be a connected nilpotent Lie group and H a connected subgroup of G. We give an explicit formula for the distance to the origin with the exponential coordinates of the second kind of g∈G. Using this fact, we prove that the distance to the origin of any element in H is bounded by a polynomial function of the distance to the origin in the group G. The degree of the polynomial is the nilpotency rank of the group G.     

A note on the weakly convex and convex domination numbers of a torus

The distanced_G(u,v) between two vertices u and v in a connected graph G is the length of the shortest (u,v) path in G. A (u,v) path of length d_G(u,v) is called a (u,v)-geodesic. A set X⊆V is called weakly convex in G if for every two vertices a,b∈X, exists an (a,b)-geodesic, all of whose vertices belong to X. A set X is convex in G if for all a,b∈X all vertices from every (a,b)-geodesic belong to X. The weakly convex domination number of a graph G is the minimum cardinality of a weakly convex dominating set of G, while the convex domination number of a graph G is the minimum cardinality of a convex dominating set of G. In this paper we consider weakly convex and convex domination numbers of tori.     

Enumerations of vertex orders of almost Moore digraphs with selfrepeats

An almost Moore digraph G of degree d>1, diameter k>1 is a diregular digraph with the number of vertices one less than the Moore bound. If G is an almost Moore digraph, then for each vertex u∈V(G) there exists a vertex v∈V(G), called repeat of u and denoted by r(u)=v, such that there are two walks of length ?k from u to v. The smallest positive integer p such that the composition r^p(u)=u is called the order of u. If the order of u is 1 then u is called a selfrepeat. It is known that if G is an almost Moore digraph of diameter k?3 then G contains exactly k selfrepeats or none. In this paper, we propose an exact formula for the number of all vertex orders in an almost Moore digraph G containing selfrepeats, based on the vertex orders of the out-neighbours of any selfrepeat vertex.     

On an extension of distance hereditary graphs

Given a simple and finite connected graph G, the distance d_G(u,v) is the length of the shortest induced {u,v}-path linking the vertices u and v in G. Bandelt and Mulder [H.J. Bandelt, H.M. Mulder, Distance hereditary graphs, J. Combin. Theory Ser. B 41 (1986) 182-208] have characterized the class of distance hereditary graphs where the distance is preserved in each connected induced subgraph. In this paper, we are interested in the class of k-distance hereditary graphs (k∈N) which consists in a parametric extension of the distance heredity notion. We allow the distance in each connected induced subgraph to increase by at most k. We provide a characterization of k-distance hereditary graphs in terms of forbidden configurations for each k≥2.     

A Lower Bound for the Height of a Rational Function at <Emphasis Type="Italic">S</Emphasis>-unit Points

Let a,b be given, multiplicatively independent positive integers and let >0. In a recent paper jointly with Y. Bugeaud we proved the upper bound exp(n) for g.c.d.(aⁿ–1, bⁿ–1); shortly afterwards we generalized this to the estimate g.c.d.(u–1,v–1)v) for multiplicatively independent S-units u,vZ. In a subsequent analysis of those results it turned out that a perhaps better formulation of them may be obtained in terms of the language of heights of algebraic numbers. In fact, the purposes of the present paper are: to generalize the upper bound for the g.c.d. to pairs of rational functions other than {u–1,v–1} and to extend the results to the realm of algebraic numbers, giving at the same time a new formulation of the bounds in terms of height functions and algebraic subgroups of G_m².     

Quelques observations concernant les ensembles de Ditkin d'un groupe localement compact

We prove that every closed normal subgroupH of a locally compact amenable groupG is a Ditkin set with respect to the Herz-Figà-Talamanca algebraA _p (G) (p>1). Let be the canonical map ofG ontoG/H andF a closed subset ofG/H. We show thatF is a Ditkin set if and only if everyuA _p (G), which vanishes on ^–1, lies on the norm closure of the subspace ofA _p (G) generated by {u _h |hH, vA _p (G)C ₀₀(G)} whereu _h (x)=u(x h). As far as we know, this result seems to be new even forG abelian andp=2.     

On Lie algebra decompositions related to spherical homogeneous spaces

LetG be a connected, reductive, linear algebraic group over an algebraically closed fieldk of characteristik zero. LetH ₁ andH ₂ be two spherical subgroups ofG. It is shown that for allg in a Zariski open subset ofG one has a Lie algebra decomposition g = h₁ + Adg ? h₂, where a is the Lie algebra of a torus and dim a ≤ min (rankG/H ₁,rankG/H ₂). As an application one obtains an estimate of the transcendence degree of the fieldk(G/H ₁ xG/H ₂) ^G for the diagonal action ofG. Ifk = ? andG _a is a real form ofG defined by an antiholomorphic involution σ :G→G then for a spherical subgroup H ? G and for allg in a Hausdorff open subset ofG one has a decomposition g = g_a + a Adg ? h, where a is the Lie algebra of σ-invariant torus and dim a ≤ rankG/H.     

A new result on Davenport constant

Let G be a finite abelian group of order n and Davenport constant D(G). Let S=⁰h(S)_∏g∈Ggvg(S)∈F(G) be a sequence with a maximal multiplicity h(S) attained by 0 and t=|S|?n+D(G)−1. Then 0∈k_∑(S) for every 1?k?t+1−D(G). This is a refinement of the fundamental result of Gao [W.D. Gao, A combinatorial problem on finite abelian groups, J. Number Theory 58 (1996) 100-103].     

On subword decomposition and balanced polynomials

Let H(x) be a monic polynomial over a finite field F=GF(q). Denote by Na(n) the number of coefficients in Hn which are equal to an element a∈F, and by G the set of elements a∈F^× such that Na(n)>0 for some n. We study the relationship between the numbers (Na(n))_a∈G and the patterns in the base q representation of n. This enables us to prove that for “most” n's we have Na(n)≈Nb(n), a,b∈G. Considering the case H=x+1, we provide new results on Pascal's triangle modulo a prime. We also provide analogous results for the triangle of Stirling numbers of the first kind.     

Second cohomology groups for Frobenius kernels and related structures

Let G be a simple simply connected affine algebraic group over an algebraically closed field k of characteristic p for an odd prime p. Let B be a Borel subgroup of G and U be its unipotent radical. In this paper, we determine the second cohomology groups of B and its Frobenius kernels for all simple B-modules. We also consider the standard induced modules obtained by inducing a simple B-module to G and compute all second cohomology groups of the Frobenius kernels of G for these induced modules. Also included is a calculation of the second ordinary Lie algebra cohomology group of Lie(U) with coefficients in k.     

On spanning connected graphs

A k-containerC(u,v) of G between u and v is a set of k internally disjoint paths between u and v. A k-container C(u,v) of G is a k^*-container if the set of the vertices of all the paths in C(u,v) contains all the vertices of G. A graph G is k^*-connected if there exists a k^*-container between any two distinct vertices. Therefore, a graph is 1^*-connected (respectively, 2^*-connected) if and only if it is hamiltonian connected (respectively, hamiltonian). In this paper, a classical theorem of Ore, providing sufficient conditional for a graph to be hamiltonian (respectively, hamiltonian connected), is generalized to k^*-connected graphs.     

Perfect matchings of a graph associated with a binary de Bruijn digraph

Let B_n be the binary de Bruijn digraph of order n and W the quotient set of the set of vertices of B_n with respect to the equivalence relation of rotation. Let G be the graph which has W as the set of vertices and in which two elements C and H are adjacent when there exist a vertex v of C and a vertex u of H such that (v,u) is an arc of B_n. Recently the problem of establishing whether the graph G has a perfect matching was posed. In this paper we answer in the positive to this problem in the case of n odd.     

Sur les semi-caracteres des groupes de Lie resolubles connexes

Let G be a connected solvable Lie group, π a normal factor representation of G and ψ a nonzero trace on the factor generated by G. We denote by $\text{D}$(G) the space of C^∞ functions on G which are compactly supported. We show that there exists an element u of the enveloping algebra U$\text{G}$_$\text{c}$ of the complexification of the Lie algebra of G for which the linear form $\text{? ψ(π(u 1 ?))}$ on $\text{D}$(G) is a nonzero semiinvariant distribution on G. The proof uses results about characters for connected solvable Lie groups and results about the space of primitive ideals of the enveloping algebra U$\text{G}$_$\text{c}$.     

Geodesic-pancyclic graphs

A shortest path connecting two vertices u and v is called a u-v geodesic. The distance between u and v in a graph G, denoted by d_G(u,v), is the number of edges in a u-v geodesic. A graph G with n vertices is panconnected if, for each pair of vertices u,v∈V(G) and for each integer k with d_G(u,v)?k?n-1, there is a path of length k in G that connects u and v. A graph G with n vertices is geodesic-pancyclic if, for each pair of vertices u,v∈V(G), every u-v geodesic lies on every cycle of length k satisfying max{2d_G(u,v),3}?k?n. In this paper, we study sufficient conditions of geodesic-pancyclic graphs. In particular, we show that most of the known sufficient conditions of panconnected graphs can be applied to geodesic-pancyclic graphs.     

Graphs admitting transitive commutative group actions

Let X be a compact metric space, and Homeo(X) be the group consisting of all homeomorphisms from X to X. A subgroup H of Homeo(X) is said to be transitive if there exists a point x∈X such that {k(x):k∈H} is dense in X. In this paper we show that, if X=G is a connected graph, then the following five conditions are equivalent: (1) Homeo(G) has a transitive commutative subgroup; (2) G admits a transitive Z²-action; (3) G admits an edge-transitive commutative group action; (4) G admits an edge-transitive Z²-action; (5) G is a circle, or a k-fold loop with k?2, or a k-fold polygon with k?2, or a k-fold complete bigraph with k?1. As a corollary of this result, we show that a finite connected simple graph whose automorphism group contains an edge-transitive commutative subgroup is either a cycle or a complete bigraph.     

A note on Roman domination in graphs

Let G=(V,E) be a simple graph. A subset S⊆V is a dominating set of G, if for any vertex u∈V-S, there exists a vertex v∈S such that uv∈E. The domination number of G, γ(G), equals the minimum cardinality of a dominating set. A Roman dominating function on graph G=(V,E) is a function f:V→{0,1,2} satisfying the condition that every vertex v for which f(v)=0 is adjacent to at least one vertex u for which f(u)=2. The weight of a Roman dominating function is the value f(V)=∑_v∈Vf(v). The Roman domination number of a graph G, denoted by γ_R(G), equals the minimum weight of a Roman dominating function on G. In this paper, for any integer k(2?k?γ(G)), we give a characterization of graphs for which γ_R(G)=γ(G)+k, which settles an open problem in [E.J. Cockayne, P.M. Dreyer Jr, S.M. Hedetniemi et al. On Roman domination in graphs, Discrete Math. 278 (2004) 11-22].     

Witt groups and unipotent elements in algebraic groups

Let G be a semisimple algebraic group defined over an algebraicallyclosed field K of good characteristic p>0. Let u be a unipotentelement of G of order p^t, for some t N. In this paper it isshown that u lies in a closed subgroup of G isomorphic to theit Witt group W^t(K), which is a t-dimensional connected abelianunipotent algebraic group. 2000 Mathematics Subject Classification:20G15.     

Constructing and classifying neighborhood anti-Sperner graphs

For a simple graph G let N_G(u) be the (open) neighborhood of vertex u∈V(G). Then G is neighborhood anti-Sperner (NAS) if for every u there is a v∈V(G)?{u} with N_G(u)⊆N_G(v). And a graph H is neighborhood distinct (ND) if every neighborhood is distinct, i.e., if N_H(u)≠N_H(v) when u≠v, for all u and v∈V(H).In Porter and Yucas [T.D. Porter, J.L. Yucas. Graphs whose vertex-neighborhoods are anti-sperner, Bulletin of the Institute of Combinatorics and its Applications 44 (2005) 69-77] a characterization of regular NAS graphs was given: ‘each regular NAS graph can be obtained from a host graph by replacing vertices by null graphs of appropriate sizes, and then joining these null graphs in a prescribed manner’. We extend this characterization to all NAS graphs, and give algorithms to construct all NAS graphs from host ND graphs. Then we find and classify all connected r-regular NAS graphs for r=0,1,…,6.