We call a vertex x of a graph G = (V,E) a codominated vertex if NG[y] ⊆ NG[x] for some vertex y ∈ V \{x}, and a graph G is called codismantlable if either it is an edgeless graph or it contains a codominated vertex x such that G − x is codismantlable. We show that (C4, C5)-free vertex-decomposable graphs are codismantlable, and prove that if G is a (C4, C5, C7)-free well-covered graph, then ver...

Genetic algorithms (GAs) are useful in the eld of continuous parameter optimization. Many results indicate that, due to their robust-ness and their ability of escaping from local optima, GAs are especially suitable for optimizing multimodal functions that contain millions of misleading local optima. The existing theory is based on spherical symmetric functions and suggest an O(n ln n) complexit...

We investigate the relation of Lie point symmetries for geodesic equations with collineations decomposable spacetimes. review previous results in literature on and we follow a proposed geometric construction approach differential equations. In this study prove that projective $\left( n+1\right) \,$% -dimensional Riemannian space are $n$-dimensional subspace. demonstrate application our presenta...

We consider N-fold 4-block decomposable integer programs, which simultaneously generalize N-fold integer programs and two-stage stochastic integer programs with N scenarios. In previous work [R. Hemmecke, M. Köppe, R. Weismantel, A polynomial-time algorithm for optimizing over N-fold 4block decomposable integer programs, Proc. IPCO 2010, Lecture Notes in Computer Science, vol. 6080, Springer, 2...

A graph G is called randomly H − decomposable if every maximal H − packing in G uses all edges in G. G is called H − equipackable if every maximal H − packing in G is also a maximum H − packing in G. M2 − decomposable graphs, randomly M2 − decomposable graphs and M2 − equipackable graphs have been characterized. The definitions could be generalized to multigraphs. And M2 − decomposable multigra...

Let H be a fixed graph without isolated vertices, and let G be a graph on n vertices. Let 2 ≤ k ≤ n− 1 be an integer. We prove that if k ≤ n− 2 and every k-vertex induced subgraph of G is H-decomposable then G or its complement is either a complete graph or a complete bipartite graph. This also holds for k = n − 1 if all the degrees of the vertices of H have a common factor. On the other hand, ...

Verbal idioms can be divided into two main groups: non-compositional idioms as kick the bucket and composit ional /decomposable idioms as spill the beans. In the following we will point to the fact that there are German decomposable idioms which can be decomposed into components, having identifiable meanings contributing to the meaning of the whole. These idiom compoimnts are taken to have refe...

Let F ={H1, . . . ,Hk} be a family of graphs. A graph G with m edges is called totallyF -decomposable if for every linear combination of the form α1e(H1)+ · · ·+αke(Hk) = m whereeach αi is a nonnegative integer, there is a coloring of the edges of G with α1 + · · ·+ αk colorssuch that exactly αi color classes induce each a copy of Hi, for i = 1, . . . , k. We prove that ...