‎Recently‎, ‎some techniques such as adding whiskers and attaching graphs to vertices of a given graph‎, ‎have been proposed for constructing a new vertex decomposable graph‎. ‎In this paper‎, ‎we present a new method for constructing vertex decomposable graphs‎. ‎Then we use this construction to generalize the result due to Cook and Nagel‎.

----------------------------In this paper we justify the use of the between-groups S-convex relative inequality to measure interregional convergence, within an axiomatic normative context. In addition, the use of additive decomposable inequality indices makes the additive multidimensional (and multilevel) inequality decomposition possible, and help us better understand the evolution of the betw...

A graph G of order n is called arbitrarily vertex decomposable if for each sequence (a1, . . . , ak) of positive integers such that a1+. . .+ak = n there exists a partition (V1, . . . , Vk) of the vertex set of G such that for each i ∈ {1, . . . , k}, Vi induces a connected subgraph of G on ai vertices. D. Barth and H. Fournier showed that if a tree T is arbitrarily vertex decomposable, then T ...

Alspach conjectured that every connected Cayley graph on a finite Abelian group A is Hamiltondecomposable. Liu has shown that for |A| even, if S = {s1, . . . , sk} ⊂ A is an inverse-free strongly minimal generating set of A, then the Cayley graph Cay(A;S?), is decomposable into k Hamilton cycles, where S? denotes the inverse-closure of S. Extending these techniques and restricting to the 6-regu...

Study of fuzzy entropy on intuitionistic fuzzy sets (IFSs) were proposed, and analyzed. Built in uncertainty in IFSs, it is named as hesitance. It is contained in fuzzy membership function in itself by definition. Hence, designing fuzzy entropy is not easy because there is no general entropy definition about IFSs. By considering existing fuzzy entropy definitions, fuzzy entropy on IFSs is desig...