Skew Models I

If g and G are the pdf and the cdf of a distribution symmetric around 0 then the pdf 2g(u)G(λ u) is said to define a skew distribution. In this paper, we provide a mathematical treatment of the skew distributions when g and G are taken to come from one of Laplace, logistic, Student’s t, uniform, exponential power or the Bessel function distribution.      

Up-embeddability via girth and the degree-sum of adjacent vertices

Let G be a simple graph of order n and girth g. For any two adjacent vertices u and v of G, if d _G (u) + d _G (v) ⩾ n − 2g + 5 then G is up-embeddable. In the case of 2-edge-connected (resp. 3-edge-connected) graph, G is up-embeddable if d _G (u) + d _G (v) ⩾ n − 2g + 3 (resp. d _G (u) + d _G (v) ⩾ n − 2g −5) for any two adjacent vertices u and v of G. Furthermore, the above three lower bounds are all shown to be tight. This work was supported by National Natural Science Foundation of China (Grant No. 10571013)     

The geodetic numbers of graphs and digraphs

For every two vertices u and v in a graph G,a u-v geodesic is a shortest path between u and v.Let I(u,v)denote the set of all vertices lying on a u-v geodesic.For a vertex subset S,let I(S) denote the union of all I(u,v)for u,v∈S.The geodetic number g(G)of a graph G is the minimum cardinality of a set S with I(S)=V(G).For a digraph D,there is analogous terminology for the geodetic number g(D).The geodetic spectrum of a graph G,denoted by S(G),is the set of geodetic numbers of all orientations of graph G.The lower geodetic number is g~-(G)=minS(G)and the upper geodetic number is g~ (G)=maxS(G).The main purpose of this paper is to study the relations among g(G),g~-(G)and g~ (G)for connected graphs G.In addition,a sufficient and necessary condition for the equality of g(G)and g(G×K_2)is presented,which improves a result of Chartrand,Harary and Zhang.     

Sufficient conditions for λ′‐optimality in graphs with girth g

For a connected graph the restricted edge‐connectivity λ′(G) is defined as the minimum cardinality of an edge‐cut over all edge‐cuts S such that there are no isolated vertices in G–S. A graph G is said to be λ′‐optimal if λ′(G) = ξ(G), where ξ(G) is the minimum edge‐degree in G defined as ξ(G) = min{d(u) + d(v) ? 2:uv ∈ E(G)}, d(u) denoting the degree of a vertex u. A. Hellwig and L. Volkmann [Sufficient conditions for λ′‐optimality in graphs of diameter 2, Discrete Math 283 (2004), 113–120] gave a sufficient condition for λ′‐optimality in graphs of diameter 2. In this paper, we generalize this condition in graphs of diameter g ? 1, g being the girth of the graph, and show that a graph G with diameter at most g ? 2 is λ′‐optimal. © 2006 Wiley Periodicals, Inc. J Graph Theory 52: 73–86, 2006     

Orthogonal factorizations of digraphs

Let G be a digraph with vertex set V(G) and arc set E(G) and let g = (g ⁻, g ⁺) and ƒ = (ƒ ⁻, ƒ ⁺) be pairs of positive integer-valued functions defined on V(G) such that g ⁻(x) ⩽ ƒ ⁻(x) and g ⁺(x) ⩽ ƒ ⁺(x) for each x ∈ V(G). A (g, ƒ)-factor of G is a spanning subdigraph H of G such that g ⁻(x) ⩽ id _H (x) ⩽ ƒ ⁻(x) and g ⁺(x) ⩽ od _H (x) ⩽ ƒ ⁺(x) for each x ∈ V(H); a (g, ƒ)-factorization of G is a partition of E(G) into arc-disjoint (g, ƒ)-factors. Let = {F ₁, F ₂,…, F _m} and H be a factorization and a subdigraph of G, respectively. is called k-orthogonal to H if each F _i , 1 ⩽ i ⩽ m, has exactly k arcs in common with H. In this paper it is proved that every (mg+m−1,mƒ−m+1)-digraph has a (g, f)-factorization k-orthogonal to any given subdigraph with km arcs if k ⩽ min{g ⁻(x), g ⁺(x)} for any x ∈ V(G) and that every (mg, mf)-digraph has a (g, f)-factorization orthogonal to any given directed m-star if 0 ⩽ g(x) ⩽ f(x) for any x ∈ V(G). The results in this paper are in some sense best possible.      

Up-Embeddability of a Graph by Order and Girth

Let G be a connected graph of order n and girth g. If d_G(u) + d_G(v) ≥ n − 2g + 5 for any two non-adjacent vertices u and v, then G is up-embeddable. Further more, the lower bound is best possible. Similarly the result of k-edge connected simple graph with girth g is also obtained, k = 2,3. Partially supported by the Postdoctoral Seience Foundation of Central South University and NNSFC under Grant No. 10751013.     

The number of shortest cycles and the chromatic uniqueness of a graph

For a graph G, let g(G) and σ_g(G) denote, respectively, the girth of G and the number of cycles of length g(G) in G. In this paper, we first obtain an upper bound for σ_g(G) and determine the structure of a 2-connected graph G when σ_g(G) attains the bound. These extremal graphs are then more-or-less classified, but one case leads to an unsolved problem. The structural results are finally applied to show that certain families of graphs are chromatically unique.     

Edge‐partitions of planar graphs and their game coloring numbers

Let G be a planar graph and let g(G) and Δ(G) be its girth and maximum degree, respectively. We show that G has an edge‐partition into a forest and a subgraph H so that (i) Δ(H) ≤ 4 if g(G) ≥ 5; (ii) Δ(H) ≤ 2 if g(G) ≥ 7; (iii) Δ(H)≤ 1 if g(G) ≥ 11; (iv) Δ(H) ≤ 7 if G does not contain 4‐cycles (though it may contain 3‐cycles). These results are applied to find the following upper bounds for the game coloring number col_g(G) of a planar graph G: (i) col_g(G) ≤ 8 if g(G) ≥ 5; (ii) col_g(G)≤ 6 if g(G) ≥ 7; (iii) col_g(G) ≤ 5 if g(G) ≥ 11; (iv) col_g(G) ≤ 11 if G does not contain 4‐cycles (though it may contain 3‐cycles). © 2002 Wiley Periodicals, Inc. J Graph Theory 41: 307–317, 2002     

On Group Chromatic Number of Graphs

Let G be a graph and A an Abelian group. Denote by F(G, A) the set of all functions from E(G) to A. Denote by D an orientation of E(G). For f ∈ F(G,A), an (A,f)-coloring of G under the orientation D is a function c : V(G)↦A such that for every directed edge uv from u to v, c(u)−c(v) ≠ f(uv). G is A-colorable under the orientation D if for any function f ∈ F(G, A), G has an (A, f)-coloring. It is known that A-colorability is independent of the choice of the orientation. The group chromatic number of a graph G is defined to be the least positive integer m for which G is A-colorable for any Abelian group A of order ≥m, and is denoted by χ_g(G). In this note we will prove the following results. (1) Let H₁ and H₂ be two subgraphs of G such that V(H₁)∩V(H₂)=∅ and V(H₁)∪V(H₂)=V(G). Then χ_g(G)≤min{max{χ_g(H₁), max_v∈V(H2)deg(v,G)+1},max{χ_g(H₂), max_u∈V(H1) deg (u, G) + 1}}. We also show that this bound is best possible. (2) If G is a simple graph without a K_3,3-minor, then χ_g(G)≤5.     

（g, f）-Factorizations Randomly Orthogonal to a Subgraph in Graphs

Let G be a graph with vertex set V(G) and edge set E(G) and let g and f be two integervalued functions defined on V(G) such that 2k - 2 ≤g(x)≤f(x) for all x∈V(G). Let H be a subgraph of G with mk edges. In this paper, it is proved that every (mg m-1,mf-m 1)-graph G has (g, f)-factorizations randomly k-orthogonal to H under some special conditions.     

Centers to centroids in graphs

For S ? V(G) the S-center and S-centroid of G are defined as the collection of vertices u ∈ V(G) that minimize e_s(u) = max {d(u, v): v ∈ S} and d_s(u) = ∑_u∈S d(u, v), respectively. This generalizes the standard definition of center and centroid from the special case of S = V(G). For 1 ? k ?|V(G)| and u ∈ V(G) let r_k(u) = max {∑_s∈S d(u, s): S ? V(G), |S| = k}. The k-centrum of G, denoted C(G; k), is defined to be the subset of vertices u in G for which r_k(u) is a minimum. This also generalizes the standard definitions of center and centroid since C(G; 1) is the center and C(G; |V(G)|) is the centroid. In this paper the structure of these sets for trees is examined. Generalizations of theorems of Jordan and Zelinka are included.     

On the existence of (3,λ)‐semiframes of type 3u

A (k,λ)‐semiframe of type g^u is a (k,λ)‐group‐divisible design of type g^u (??, ??, ??), in which the collection of blocks ?? can be written as a disjoint union ??=??∪?? where ?? is partitioned into parallel classes of ?? and ?? is partitioned into holey parallel classes, each holey parallel class being a partition of ??\G_j for some G_j∈??. In this paper, we shall prove that the necessary conditions for (3,λ)‐semiframes of type 3^u are also sufficient with one exception. © 2009 Wiley Periodicals, Inc. J Combin Designs 17: 253–265, 2009     

The eccentric connectivity index of nanotubes and nanotori

Let G be a molecular graph. The eccentric connectivity index ξ^c(G) is defined as ξ^c(G)=∑_u∈V(G)deg_G(u)ε_G(u), where deg_G(u) denotes the degree of vertex u and ε_G(u) is the largest distance between u and any other vertex v of G. In this paper exact formulas for the eccentric connectivity index of TUC₄C₈(S) nanotube and TC₄C₈(S) nanotorus are given.     

Extensions of Modules over Hopf Algebras Arising from Lie Algebras of Cartan Type

In this paper we prove that there are no self-extensions of simple modules over restricted Lie algebras of Cartan type. The proof given by Andersen for classical Lie algebras not only uses the representation theory of the Lie algebra, but also representations of the corresponding reductive algebraic group. The proof presented in the paper follows in the same spirit by using the construction of a infinite-dimensional Hopf algebra D(G) u( ) containing u( ) as a normal Hopf subalgebra, and the representation theory of this algebra developed in our previous work. Finite-dimensional hyperalgebra analogs D(G _r ) u( ) have also been constructed, and the results are stated in this setting.     

Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs

A Steiner tree for a set S of vertices in a connected graph G is a connected subgraph of G with a smallest number of edges that contains S. The Steiner interval I(S) of S is the union of all the vertices of G that belong to some Steiner tree for S. If S={u,v}, then I(S)=I[u,v] is called the interval between u and v and consists of all vertices that lie on some shortest u-v path in G. The smallest cardinality of a set S of vertices such that ?_u,v∈SI[u,v]=V(G) is called the geodetic number and is denoted by g(G). The smallest cardinality of a set S of vertices of G such that I(S)=V(G) is called the Steiner geodetic number of G and is denoted by sg(G). We show that for distance-hereditary graphs g(G)?sg(G) but that g(G)/sg(G) can be arbitrarily large if G is not distance hereditary. An efficient algorithm for finding the Steiner interval for a set of vertices in a distance-hereditary graph is described and it is shown how contour vertices can be used in developing an efficient algorithm for finding the Steiner geodetic number of a distance-hereditary graph.     

从偏态Pearson Ⅶ分布生成的新的多元偏态t分布

一般而言,偏态的椭球等高分布是一类分布族,有相当一部分的分布都是积分形式,且此类积分不易求出,而偏态的正态、偏态的正态尺度混合、偏态的PⅦ型、偏态的PⅡ型的分布却有着很好的结构,偏态t分布属于偏态PⅦ型分布,因此,本文在偏态PⅦ型分布的基础上着重研究新的偏态t分布,给出它的背景、定义、两种随机表示及其等价性.     

Comparison results for nonlinear elliptic equations with lower–order terms

We consider a solution u of the homogeneous Dirichlet problem for a class of nonlinear elliptic equations in the form A(u) + g(x, u) = f, where the principal term is a Leray–Lions operator defined on and g(x, u) is a term having the same sign as u and satisfying suitable growth assumptions. We prove that the rearrangement of u can be estimated by the solution of a problem whose data are radially symmetric.     

Picard iterates for positive solutions of a class of nonlinear eigenvalue problems

Summary We study positive solutions of the nonlinear eigenvalue problemF(u)=G(u) with some monotone operatorsF andG. In particular, we consider the case of nonlinear elliptic differential equations of second order and chooseF(u)=–divA(x, gradu)+b(x,u) and G(u)=g (x,u). Positive solutions are obtained by the Picard iterationsu ₀=0 andF(u _n+1)=G(u _n ).In order to get convergence of the sequenceu _n ,one has to study some comparison principles for the operatorF. Finally, the Picard iteration scheme allows a-priori estimates and bifurcation results for the admissible eigenvalue parameter.

---

Zusammenfassung Für gewisse monotone OperatorenF andG untersuchen wir positive Lösungen des nichtlinearen EigenwertproblemsF(u)=G(u). Insbesondere betrachten wir nichtlineare elliptische Differentialgleichungen zweiter Ordnung und wählenF(u)=–divA(x, gradu)+b(x,u) sowieG(u)=g(x,u). Man erhält positive Lösungen durch das Picard-Iterationsverfahrenu ₀=0 undF(u _n+1)=G(u _n ).Um die Konvergenz der Folgeu _n nachzuweisen, benötigt man Vergleichsprinzipien fürF. Dann gestattet das Iterationsschema sogar a-priori Abschätzungen und Verzweigungsaussagen für die zulässigen Eigenwertparameter.

---

---

Supported by the Deutscher Akademischer Austauschdienst (DAAD) and DICYT-University of Santiago de Chile.     

On Properties of a Graph that Depend on its Distance Function

If G is a connected graph with distance function d, then by a step in G is meant an ordered triple (u, x, v) of vertices of G such that d(u, x) = 1 and d(u, v) = d(x, v) + 1. A characterization of the set of all steps in a connected graph was published by the present author in 1997. In Section 1 of this paper, a new and shorter proof of that characterization is presented. A stronger result for a certain type of connected graphs is proved in Section 2.     

On Homomorphisms between <Emphasis Type="Italic">C</Emphasis>*-Algebras and Linear Derivations on <Emphasis Type="Italic">C</Emphasis>*-Algebras

It is shown that every almost linear Pexider mappings f, g, h from a unital C*-algebra into a unital C*-algebra ℬ are homomorphisms when f(2 ⁿ _uy) = f(2 ⁿ u)f(y), g(2 ⁿ uy) = g(2 ⁿ u)g(y) and h(2 ⁿ uy) = h(2 ⁿ u)h(y) hold for all unitaries u ∈ , all y ∈ , and all n ∈ ℤ, and that every almost linear continuous Pexider mappings f, g, h from a unital C*-algebra of real rank zero into a unital C*-algebra ℬ are homomorphisms when f(2 ⁿ uy) = f(2 ⁿ u)f(y), g(2 ⁿ uy) = g(2 ⁿ u)g(y) and h(2 ⁿ uy) = h(2 ⁿ u)h(y) hold for all u ∈ {v ∈ : v = v* and v is invertible}, all y ∈ and all n ∈ ℤ. Furthermore, we prove the Cauchy-Rassias stability of *-homomorphisms between unital C*-algebras, and ℂ-linear *-derivations on unital C*-algebras. This work was supported by Korea Research Foundation Grant KRF-2003-042-C00008. The second author was supported by the Brain Korea 21 Project in 2005.