The 0–1 inverse maximum stable set problem

In this paper we study the 0–1 inverse maximum stable set problem, denoted by IS_{0,1}. Given a graph and a fixed stable set, it is to delete the minimum number of vertices to make this stable set maximum in the new graph. We also consider IS_{0,1} against a specific algorithm such as Greedy and 2opt, aiming to delete the minimum number of vertices so that the algorithm selects the given stable set in the new graph; we denote them by IS_{0,1},greedy and IS_{0,1},2opt, respectively. Firstly, we show that they are NP-hard, even if the fixed stable set contains only one vertex. Secondly, we achieve an approximation ratio of for IS_{0,1},2opt. Thirdly, we study the tractability of IS_{0,1} for some classes of perfect graphs such as comparability, co-comparability and chordal graphs. Finally, we compare the hardness of IS_{0,1} and IS_{0,1},2opt for some other classes of graphs.     

Explicit solution of the finite time L2-norm polynomial approximation problem

The aim of this paper is to present a new approach to the finite time L₂-norm polynomial approximation problem. A new formulation of this problem leads to an equivalent linear system whose solution can be investigated analytically. Such a solution is then specialized for a polynomial expressed in terms of Laguerre and Bernstein basis.     

Iterative approximation of a solution of multi-valued variational-like inclusion in Banach spaces: A P-η-proximal-point mapping approach

In this paper, we introduce a class of P-η-accretive mappings, an extension of η-m-accretive mappings [C.E. Chidume, K.R. Kazmi, H. Zegeye, Iterative approximation of a solution of a general variational-like inclusion in Banach spaces, Int. J. Math. Math. Sci. 22 (2004) 1159-1168] and P-accretive mappings [Y.-P. Fang, N.-J. Huang, H-accretive operators and resolvent operator technique for solving variational inclusions in Banach spaces, Appl. Math. Lett. 17 (2004) 647-653], in real Banach spaces. We prove some properties of P-η-accretive mappings and give the notion of proximal-point mapping, termed as P-η-proximal-point mapping, associated with P-η-accretive mapping. Further, using P-η-proximal-point mapping technique, we prove the existence of solution and discuss the convergence analysis of iterative algorithm, for multi-valued variational-like inclusions in real Banach space. The theorems presented in this paper extend and improve many known results in the literature.     

Counting the number of independent sets in chordal graphs

We study some counting and enumeration problems for chordal graphs, especially concerning independent sets. We first provide the following efficient algorithms for a chordal graph: (1) a linear-time algorithm for counting the number of independent sets; (2) a linear-time algorithm for counting the number of maximum independent sets; (3) a polynomial-time algorithm for counting the number of independent sets of a fixed size. With similar ideas, we show that enumeration (namely, listing) of the independent sets, the maximum independent sets, and the independent sets of a fixed size in a chordal graph can be done in constant time per output. On the other hand, we prove that the following problems for a chordal graph are #P-complete: (1) counting the number of maximal independent sets; (2) counting the number of minimum maximal independent sets. With similar ideas, we also show that finding a minimum weighted maximal independent set in a chordal graph is NP-hard, and even hard to approximate.     

The d-precoloring problem for k-degenerate graphs

In this paper we deal with the d-PRECOLORING EXTENSION (d-PREXT) problem in various classes of graphs. The d-PREXT problem is the special case of PRECOLORING EXTENSION problem where, for a fixed constant d, input instances are restricted to contain at most d precolored vertices for every available color. The goal is to decide if there exists an extension of given precoloring using only available colors or to find it.We present a linear time algorithm for both, the decision and the search version of d-PREXT, in the following cases: (i) restricted to the class of k-degenerate graphs (hence also planar graphs) and with sufficiently large set S of available colors, and (ii) restricted to the class of partial k-trees (without any size restriction on S). We also study the following problem related to d-PREXT: given an instance of the d-PREXT problem which is extendable by colors of S, what is the minimum number of colors of S sufficient to use for precolorless vertices over all such extensions? We establish lower and upper bounds on this value for k-degenerate graphs and its various subclasses (e.g., planar graphs, outerplanar graphs) and prove tight results for the class of trees.     

A variant smoothing Newton method for P0-NCP based on a new smoothing function

In this paper, we present a new one-step smoothing Newton method proposed for solving the non-linear complementarity problem with _P0$P_0$-function based on a new smoothing NCP$NCP$-function. We adopt a variant merit function. Our algorithm needs only to solve one linear system of equations and perform one line search per iteration. It shows that any accumulation point of the iteration sequence generated by our algorithm is a solution of _P0-NCP$P_0\text{-}NCP$. Furthermore, under the assumption that the solution set is non-empty and bounded, we can guarantee at least one accumulation point of the generated sequence. Numerical experiments show the feasibility and efficiency of the algorithm.     

Characterisations of Chebyshev sets in c0

A subset MX of a normed linear space X is a Chebyshev set if, for every xX, the set of all nearest points from M to x is a singleton. We obtain a geometrical characterisation of approximatively compact Chebyshev sets in c₀. Also, given an approximatively compact Chebyshev set M in c₀ and a coordinate affine subspace Hc₀ of finite codimension, if M∩H≠, then M∩H is a Chebyshev set in H, where the norm on H is induced from c₀.     

不含有5-圈和k4平面图的森林分解

本文研究了不含有5-圈和K₄的平面图的森林分解问题.利用权转移法,证明了任意不含有5-圈和K₄的平面图能分解成三个森林,且其中有一个森林的最大度不超过2,这一结果推广了文献[2,3]中的结论.     

Scattering of S0 Lamb mode in plate with multiple damage

A study of scattering properties of S₀ mode Lamb wave in an infinite plate with multiple damage is presented. Plate theory and wave function expansion method are used to derive the analytical solutions for the scattering wave field in plate with a single damage, and by using the addition theorems of Bessel functions, interference phenomena between scattering wave fields from different damage is investigated. Measurements agree well between theoretical results and FE simulation study of plate with two damage and validity of the model is confirmed. Numerical results of scattering displacement field in plate with two and three damage are graphically presented and discussed. An assessment of effects of damage geometric properties on the scattering properties is made.     

Paired-Domination in <Emphasis Type="Italic">P</Emphasis><Subscript>5</Subscript>-Free Graphs

A set S of vertices in a graph G is a paired-dominating set of G if every vertex of G is adjacent to some vertex in S and if the subgraph induced by S contains a perfect matching. The paired-domination number of G, denoted by , is the minimum cardinality of a paired-dominating set of G. In [1], the authors gave tight bounds for paired-dominating sets of generalized claw-free graphs. Yet, the critical cases are not claws but subdivided stars. We here give a bound for graphs containing no induced P ₅, which seems to be the critical case.     

Some bounds on the p-domination number in trees

Let p be a positive integer and G=(V,E) a graph. A subset S of V is a p-dominating set if every vertex of V-S is dominated at least p times, and S is a p-dependent set of G if the subgraph induced by the vertices of S has maximum degree at most p-1. The minimum cardinality of a p-dominating set a of G is the p-domination number γ_p(G) and the maximum cardinality of a p-dependent set of G is the p-dependence number β_p(G). For every positive integer p?2, we show that for a bipartite graph G, γ_p(G) is bounded above by (|V|+|Y_p|)/2, where Y_p is the set of vertices of G of degree at most p-1, and for every tree T, γ_p(T) is bounded below by β_p-1(T). Moreover, we characterize the trees achieving equality in each bound.     

Using the K5Connected Cognition Diagram to analyze teachers’ communication and understanding of regions in three-dimensional space

This paper reports on a study that introduces and applies the K₅Connected Cognition Diagram as a lens to explore video data showing teachers’ interactions related to the partitioning of regions by axes in a three-dimensional geometric space. The study considers “semiotic bundles” ( Arzarello, 2006), introduces “semiotic connections,” and discusses the fundamental role each plays in developing individual understanding and communication with peers. While all teachers solved the problem posed, many failed to make or verbalize connections between the types of semiotic resources introduced during their discussions.     

A topological characterization of the ω-limit sets for analytic flows on the plane, the sphere and the projective plane

In this paper the ω-limit sets for analytic and polynomial differential equations on the plane are characterized up to homeomorphisms. The analogous problem is solved in full detail for analytic flows on the sphere and the projective plane. We also explain how to carry on the same program for analytic flows defined on open subsets of these surfaces.     

Bifurcation set and number of limit cycles in Z2-equivariant planar vector fields of degree 5

An Z₂-equivariant polynomial Hamiltonian system of degree 5 with two perturbation terms is considered in this paper. The phase plane (a, b) is divided into 15 different regions which give the bifurcation set of the system. Using the bifurcation theory of planar dynamical system and the method of detection function, we obtain the bifurcation set and the configurations of compound eyes of the system with 21 or 23 limit cycles.     

Variations of Y-dominating functions on graphs

Let Y be a subset of real numbers. A Y-dominating function of a graph G=(V,E) is a function f:V→Y such that for all vertices v∈V, where N_G[v]={v}∪{u|(u,v)∈E}. Let for any subset S of V and let f(V) be the weight of f. The Y-domination problem is to find a Y-dominating function of minimum weight for a graph G=(V,E). In this paper, we study the variations of Y-domination such as {k}-domination, k-tuple domination, signed domination, and minus domination for some classes of graphs. We give formulas to compute the {k}-domination, k-tuple domination, signed domination, and minus domination numbers of paths, cycles, n-fans, n-wheels, n-pans, and n-suns. Besides, we present a unified approach to these four problems on strongly chordal graphs. Notice that trees, block graphs, interval graphs, and directed path graphs are subclasses of strongly chordal graphs. This paper also gives complexity results for the problems on doubly chordal graphs, dually chordal graphs, bipartite planar graphs, chordal bipartite graphs, and planar graphs.     

Partial characterizations of circle graphs

A circle graph is the intersection graph of a family of chords on a circle. There is no known characterization of circle graphs by forbidden induced subgraphs that do not involve the notions of local equivalence or pivoting operations. We characterize circle graphs by a list of minimal forbidden induced subgraphs when the graph belongs to one of the following classes: linear domino graphs, P₄-tidy graphs, and tree-cographs. We also completely characterize by minimal forbidden induced subgraphs the class of unit Helly circle graphs, which are those circle graphs having a model whose chords have all the same length, are pairwise different, and satisfy the Helly property.     

The path partition problem and related problems in bipartite graphs

We prove that it is NP-complete to decide whether a bipartite graph of maximum degree three on nk vertices can be partitioned into n paths of length k. Finally, we propose some approximation and inapproximation results for several related problems.     

Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs

We show that the class of unit grid intersection graphs properly includes both of the classes of interval bigraphs and of P₆-free chordal bipartite graphs. We also demonstrate that the classes of unit grid intersection graphs and of chordal bipartite graphs are incomparable.     

Some complexity problems on single input double output controllers

We investigate the time complexity of constructing single input double output state feedback controller structures, given the directed structure graph G of a system. Such a controller structure defines a restricted type of P₃-partition of the graph G. A necessary condition (∗) is described and some classes of graphs are identified where the search problem of finding a feasible P₃-partition is polynomially solvable and, in addition, (∗) is not only necessary but also sufficient for the existence of a P₃-partition. It is also proved that the decision problem on two particular graph classes — defined in terms of forbidden subgraphs — remains NP-complete, but is polynomially solvable on the intersection of those two classes. The polynomial-time solvability of some further related problems is shown, too.