Binding numbers for fractional ID-k-factor-critical graphs

LetG be a graph,and k≥2 be a positive integer.A graph G is fractional independentset-deletable k-factor-critical(in short,fractional ID-k-factor-critical),if G I has a fractional k-factor for every independent set I of G.The binding number bind(G)of a graph G is defined as bind(G)=min|NG(X)||X|:=X V(G),NG(X)=V(G).In this paper,it is proved that a graph G is fractional ID-k-factor-critical if n≥6k 9 and bind(G)(3k 1)(n 1)kn 2k+2.     

Cantor-type cylindrical-coordinate method for differential equations with local fractional derivatives

In this Letter, we propose to use the Cantor-type cylindrical-coordinate method in order to investigate a family of local fractional differential operators on Cantor sets. Some testing examples are given to illustrate the capability of the proposed method for the heat-conduction equation on a Cantor set and the damped wave equation in fractal strings. It is seen to be a powerful tool to convert differential equations on Cantor sets from Cantorian-coordinate systems to Cantor-type cylindrical-coordinate systems.     

前缀码与极大前缀码的一种新刻画

在语言图Γ(X*)概念的基础上,用新引入的语言竹竿l(X*)和语言竹竿集L(X*)的概念形象地刻画了前缀码与极大前缀码:A是前缀码l(X*)∈L(X*),S_l_((X*))∩A或为单点集或为Φ;A是极大前缀码l(X*)∈L(X*),i)S_(l(X*))∩A或为单点集或为Φ.ii)S_(l(X*))∩A=Φ■u∈S_(l(X*)),■a∈A,ω∈X~+使a=uw.     

Full four‐component relativistic calculations of the one‐bond 77Se–13C spin‐spin coupling constants in the series of selenium heterocycles and their parent open‐chain selenides

Four‐component relativistic calculations of ⁷⁷Se–¹³C spin–spin coupling constants have been performed in the series of selenium heterocycles and their parent open‐chain selenides. It has been found that relativistic effects play an essential role in the selenium–carbon coupling mechanism and could result in a contribution of as much as 15–25% of the total values of the one‐bond selenium–carbon spin‐spin coupling constants. In the overall contribution of the relativistic effects to the total values of ¹J(Se,C), the scalar relativistic corrections (negative in sign) by far dominate over the spin‐orbit ones (positive in sign), the latter being of less than 5%, as compared to the former (ca 20%). A combination of nonrelativistic second‐order polarization propagator approach (CC2) with the four‐component relativistic density functional theory scheme is recommended as a versatile tool for the calculation of ¹J(Se,C). Solvent effects in the values of ¹J(Se,C) calculated within the polarizable continuum model for the solvents with different dielectric constants (ε 2.2–78.4) are next to negligible decreasing negative ¹J(Se,C) in absolute value by only about 1 Hz. The use of the locally dense basis set approach applied herewith for the calculation of ⁷⁷Se–¹³C spin‐spin coupling constants is fully justified resulting in a dramatic decrease in computational cost with only 0.1–0.2‐Hz loss of accuracy. Copyright © 2014 John Wiley & Sons, Ltd.     

An object-parameter approach to predicting unknown data in incomplete fuzzy soft sets

Incomplete data in soft sets lead to uncertainty and inaccuracy in representing and handling information. This paper introduces notions of complete distance between two objects and relative dominance degree between two parameters. Based on both the notions, an object-parameter method is proposed to predict unknown data in incomplete fuzzy soft sets. The proposal makes full use of known data, including the information from the relationship between known values of all objects on a certain parameter and the information from the relationship between known values of an object on all parameters. The effectiveness of the proposal is verified by many examples under the compared investigation of classical predicted methods.     

Generalized matching theorems for closed coverings of convex sets

In this paper we use fixed point and coincidence theorems due to Park [8] to give matching theorems concerning closed coverings of nonempty convex sets in a real topological vector space. Our new results extend previously given ones due to Ky Fan [2], [3], Shih [10], Shih and Tan [11], and Park [7].     

Ends,tangles and critical vertex sets

We show that an arbitrary infinite graph G can be compactified by its ends plus its critical vertex sets, where a finite set X of vertices of an infinite graph is critical if its deletion leaves some infinitely many components each with neighbourhood precisely equal to X. We further provide a concrete separation system whose ?₀‐tangles are precisely the ends plus critical vertex sets. Our tangle compactification is a quotient of Diestel's (denoted by ), and both use tangles to compactify a graph in much the same way as the ends of a locally finite and connected graph compactify it in its Freudenthal compactification. Finally, generalising both Diestel's construction of and our construction of , we show that G can be compactified by every inverse limit of compactifications of the sets of components obtained by deleting a finite set of vertices. Diestel's is the finest such compactification, and our is the coarsest one. Both coincide if and only if all tangles are ends. This answers two questions of Diestel.     

On the Lipschitz equivalence of self‐affine sets

Recently Lipschitz equivalence of self‐similar sets on has been studied extensively in the literature. However for self‐affine sets the problem is more awkward and there are very few results. In this paper, we introduce a w‐Lipschitz equivalence by repacing the Euclidean norm with a pseudo‐norm w. Under the open set condition, we prove that any two totally disconnected integral self‐affine sets with a common matrix are w‐Lipschitz equivalent if and only if their digit sets have equal cardinality. The main methods used are the technique of pseudo‐norm and Gromov hyperbolic graph theory on iterated function systems.     

Clique-cutsets beyond chordal graphs

Truemper configurations (thetas, pyramids, prisms, and wheels) have played an important role in the study of complex hereditary graph classes (eg, the class of perfect graphs and the class of even-hole-free graphs), appearing both as excluded configurations, and as configurations around which graphs can be decomposed. In this paper, we study the structure of graphs that contain (as induced subgraphs) no Truemper configurations other than (possibly) universal wheels and twin wheels. We also study several subclasses of this class. We use our structural results to analyze the complexity of the recognition, maximum weight clique, maximum weight stable set, and optimal vertex coloring problems for these classes. Furthermore, we obtain polynomial -bounding functions for these classes.     

Group divisible 3‐designs with block size four and group type 1ns1

In this article, we mainly consider the existence problem of a group divisible design GDD $\left(3,4,n+s\right)$ of type $1^n{s}^1$. We present two recursive constructions for this configuration using candelabra systems and construct explicitly a few small examples admitting given automorphism groups. As an application, several new infinite classes of GDD $\left(3,4,n+s\right)$s of type $1^n{s}^1$ are produced. Meanwhile a few new infinite families on candelabra quadruple systems with group sizes being odd and stem size greater than one are also obtained.