On total restrained domination in graphs

In this paper we initiate the study of total restrained domination in graphs. Let G = (V,E) be a graph. A total restrained dominating set is a set S V where every vertex in V - S is adjacent to a vertex in S as well as to another vertex in V - S, and every vertex in S is adjacent to another vertex in S. The total restrained domination number of G, denoted by _r ^t (G), is the smallest cardinality of a total restrained dominating set of G. First, some exact values and sharp bounds for _r ^t (G) are given in Section 2. Then the Nordhaus-Gaddum-type results for total restrained domination number are established in Section 3. Finally, we show that the decision problem for _r ^t (G) is NP-complete even for bipartite and chordal graphs in Section 4.This work was supported by National Natural Sciences Foundation of China (19871036).     

Inequalities involving independence domination, f-domination, connected and total f-domination numbers

Let f be an integer-valued function defined on the vertex set V(G) of a graph G. A subset D of V(G) is an f-dominating set if each vertex x outside D is adjacent to at least f(x) vertices in D. The minimum number of vertices in an f-dominating set is defined to be the f-domination number, denoted by _f (G). In a similar way one can define the connected and total f-domination numbers _c,f (G) and _t,f (G). If f(x) = 1 for all vertices x, then these are the ordinary domination number, connected domination number and total domination number of G, respectively. In this paper we prove some inequalities involving _f (G), _c,f (G), _t,f (G) and the independence domination number i(G). In particular, several known results are generalized.     

On Domination Number of 4-Regular Graphs

Let G be a simple graph. A subset S V is a dominating set of G, if for any vertex v V – S there exists a vertex u S such that uv E(G). The domination number, denoted by (G), is the minimum cardinality of a dominating set. In this paper we prove that if G is a 4-regular graph with order n, then (G) ⁴/₁₁ n     

On signed majority total domination in graphs

We initiate the study of signed majority total domination in graphs. Let G = (V, E) be a simple graph. For any real valued function f: V and S V, let . A signed majority total dominating function is a function f: V {–1, 1} such that f(N(v)) 1 for at least a half of the vertices v V. The signed majority total domination number of a graph G is = min{f(V): f is a signed majority total dominating function on G}. We research some properties of the signed majority total domination number of a graph G and obtain a few lower bounds of .This research was supported by National Natural Science Foundation of China.     

Signed Total Domination Nnumber of a Graph

The signed total domination number of a graph is a certain variant of the domination number. If is a vertex of a graph G, then N() is its oper neighbourhood, i.e. the set of all vertices adjacent to in G. A mapping f: V(G)-1, 1, where V(G) is the vertex set of G, is called a signed total dominating function (STDF) on G, if for each V(G). The minimum of values , taken over all STDF's of G, is called the signed total domination number of G and denoted by _st(G). A theorem stating lower bounds for _st(G) is stated for the case of regular graphs. The values of this number are found for complete graphs, circuits, complete bipartite graphs and graphs on n-side prisms. At the end it is proved that _st(G) is not bounded from below in general.     

A note on the independent domination number of subset graph

The independent domination number i(G) (independent number (G)) is the minimum (maximum) cardinality among all maximal independent sets of G. Haviland (1995) conjectured that any connected regular graph G of order n and degree 1/2n satisfies i(G) 2n/3 1/2. For 1 k l m, the subset graph S _m (k, l) is the bipartite graph whose vertices are the k- and l-subsets of an m element ground set where two vertices are adjacent if and only if one subset is contained in the other. In this paper, we give a sharp upper bound for i(S _m (k, l)) and prove that if k + l = m then Havilands conjecture holds for the subset graph S _m (k, l). Furthermore, we give the exact value of (S _m (k, l)).This work was supported by National Natural Sciences Foundation of China (19871036).     

Cycles in <Emphasis Type="Italic">G</Emphasis>-orbits in <Emphasis Type="Italic">G</Emphasis><Superscript><Emphasis Type="Italic">ℂ</Emphasis></Superscript>-flag manifolds

There is a natural duality between orbits of a real form G of a complex semisimple group G on a homogeneous rational manifold Z=G /P and those of the complexification K of any of its maximal compact subgroups K: (,) is a dual pair if is a K-orbit. The cycle space C() is defined to be the connected component containing the identity of the interior of {g:g() is non-empty and compact}. Using methods which were recently developed for the case of open G-orbits, geometric properties of cycles are proved, and it is shown that C() is contained in a domain defined by incidence geometry. In the non-Hermitian case this is a key ingredient for proving that C() is a certain explicitly computable universal domain.Research of the first author partially supported by Schwerpunkt Global methods in complex geometry and SFB-237 of the Deutsche Forschungsgemeinschaft.The second author was supported by a stipend of the Deutsche Akademische Austauschdienst.     

Mittelwert der Eulerschen φ-Funktion und des Quadrates der Dirichletschen Teilerfunktion in algebraischen Zahlkörpern

LetK be an algebraic number field, and for every integer K let () andd(), respectively, denote the number of relatively prime residue classes and the number of divisors of the principal ideal (). Asymptotic equalities are proved for the sums () and d ²(), where runs through certain finite sets of integers ofK.     

Turán's extremal problem in random graphs: Forbidding odd cycles

For 0<1 and graphsG andH, we writeGH if any -proportion of the edges ofG span at least one copy ofH inG. As customary, we writeC ^k for a cycle of lengthk. We show that, for every fixed integerl1 and real >0, there exists a real constantC=C(l, ), such that almost every random graphG _{n, p} withp=p(n)Cn ^–1+1/2l satisfiesG _n,p1/2+ C ^2l+1. In particular, for any fixedl1 and >0, this result implies the existence of very sparse graphsG withG _1/2+ C ^2l+1.The first author was partially supported by NSERC. The second author was partially supported by FAPESP (Proc. 93/0603-1) and by CNP_q (Proc. 300334/93-1). The third author was partially sopported by KBN grant 2 1087 91 01.     

The Domination Parameters of Cubic Graphs

Let ir(G), (G), i(G), ₀(G), (G) and IR(G) be the irredundance number, the domination number, the independent domination number, the independence number, the upper domination number and the upper irredundance number of a graph G, respectively. In this paper we show that for any nonnegative integers k₁, k₂, k₃, k₄, k₅ there exists a cubic graph G satisfying the following conditions: (G) – ir(G) k₁, i(G) – (G) k₂, ₀(G) – i(G) > k₃, (G) – ₀(G) – k₄, and IR(G) – (G) – k₅. This result settles a problem posed in [9].Supported by the INTAS and the Belarus Government (Project INTAS-BELARUS 97-0093).Supported by RUTCOR.     

On strong solutions of the Stokes equations in exterior domains

We construct strong solutionsu, p/of the general nonhomogeneous Stokes equations -u + p=f inG, ·u=g inG, u= on in an exterior domainG ⁿ (n3) with boundary of class C². Our approach uses a localization technique: With the help of suitable cut-off functions and the solution of the divergence equation ·=g inG, = 0 on , the exterior domain problem is reduced to the entire space problem and an interior problem.     

Total restrained domination in trees

Let G=(V,E) be a graph. A set S⊆V is a total restrained dominating set if every vertex is adjacent to a vertex in S and every vertex of V-S is adjacent to a vertex in V-S. The total restrained domination number of G, denoted by γ_tr(G), is the smallest cardinality of a total restrained dominating set of G. We show that if T is a tree of order n, then . Moreover, we show that if T is a tree of order , then . We then constructively characterize the extremal trees T of order n achieving these lower bounds.     

Minimal Surfaces with an Elastic Boundary

LetD:= { C ³ (

Ergodic theorems for subadditive spatial processes

Summary Let {X _G,G bounded Borel subset of LoR ^v } be a subadditive spatial process with finite constant. It will be proved that as G (in some sense), the average (1/¦G¦).X _G converges in L¹, and if in addition the process is strongly subadditive, it converges almost surely towards an invariant random variable with expectation.     

Independence in hypergraphs

Suppose an integral function (|A|)q₁ defined on the subsets of edges of a hypergraph (X,u,) satisfies the following two conditions: 1) any set W u such that |A|(|A|) for any AW is matroidally independent; 2) if W is an independent set, then there exists a unique partitionW=T₁+ T₂+...+T_v such that |T ⁱ |=(|T ⁱ |),i1:v, and for any AW, |A|(|A|) there exists a T_i such that AT_i. The form of such a function is found, in terms of parameters of generalized connected components, hypercycles, and hypertrees.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 114, pp. 196–204, 1982.     

L p -Estimates for the Navier–Stokes Equations for Steady Compressible Flow

We consider the Navier–Stokes equations for compressible isentropic flow in the steady three-dimensional case. The pressure and the kinetic energy are estimated uniformly in L^q with being the density. This is an improvement of known estimates in the case Mathematics Subject Classification (2000): 35Q30, 76N10     

A cuspidal edge of first kind with a point of asymptotic type

We shall say that an analytic surface supports a line with a singularity of order 2 if is a singular line of the surface (the first fundamental form of anyC -parametrization of is degenerate on ) and there exists aC -parametrization(s, v) of the surface such that the second derivative of in the direction orthogonal to is nonzero. We shall assume that has no singular points or points of straightening or flattening, that the Gaussian curvature of is nonpositive, and that the Gaussian curvature of has a finite limita(s) on (s is arc length on ), and the osculating plane of is tangent to in the sense that this plane contains as a half-plane the contingency of at the corresponding point of . Finally supposeb(0)=0,b(s)0 fors0, andb _ss (0)0, whereb(s)=a(s)+ ²(s) and is the torsion of . It is shown that under these hypotheses envelopes the asymptotes of one of the families of. All the asymptotes of the other family are tangent to except the asymptote passing through the points=0 of the singular line.Translated from Ukrainskií Geometricheskií Sbornik, No. 30, 1987, pp. 66–76.     

Angular limits of holomorphic functions which satisfy an integrability condition

Let (–1,1), let 2/(1–)p<, letp denote the Hölder conjugate ofp, and let be an open arc of the unit circle. It is shown that, iff is a holomorphic function on the unit disc such that: (i) (1–|z|)log⁺|f(z)| isL ^p -integrable on the sector {r:0f has an infinite asymptotic value has -finite (2–(1+)p)-dimensional Hausdorff, measure, thenf has finite angular limits on a subset of of positive linear measure. In fact, a stronger conclusion will be established.     

Some analytical properties of γ-convex functions on the real line

This paper deals with the analytical properties of -convex functions, which are defined as those functions satisfying the inequalityf(x ₁ )+f(x ₂ )f(x ₁)+f(x ₂), forx _i [x ₁,x ₂], |x _i –x _i |=, i=1,2, whenever |x ₁–x ₂|>, for some given positive . This class contains all convex functions and all periodic functions with period . In general, -convex functions do not have ideal properties as convex functions. For instance, there exist -convex functions which are totally discontinuous or not locally bounded. But -convex functions possess so-called conservation properties, meaning good properties which remain true on every bounded interval or even on the entire domain, if only they hold true on an arbitrary closed interval with length . It is shown that boundedness, bounded variation, integrability, continuity, and differentiability almost everywhere are conservation properties of -convex functions on the real line. However, -convex functions have also infection properties, meaning bad properties which propagate to other points, once they appear somewhere (for example, discontinuity). Some equivalent properties of -convexity are given. Ways for generating and representing -convex functions are described.This research was supported by the Deutsche Forschungsgemeinschaft. The first author thanks Prof. Dr. E. Zeidler and Prof. Dr. H. G. Bock for their hospitality and valuable support.     

The equation of a special algebraic surface with an infinite set of planes of oblique symmetry

Let G be an infinite group generated by oblique reflections with respect to hyperplanes in the real space E ^m ; let II , II , II be the linear spans of dimensions , , of three G-orbits of directions of symmetry, where II II II =0 and dim(II + II + II ) < + +. Some singularities of the equation of an algebraic hypersurface invariant with respect to G are established. Translated from Ukrainskii Geometricheskii Sbornik, No. 35, pp. 34–38, 1992.