In this paper, a numerical method for nding minimal solution of a mn fullyfuzzy linear system of the form Ax = b based on pseudo inverse calculation,is given when the central matrix of coecients is row full rank or column fullrank, and where A~ is a non-negative fuzzy mn matrix, the unknown vectorx is a vector consisting of n non-negative fuzzy numbers and the constant b isa vector consisting o...

The concepts of strongly 8-deletable and strongly 4-deletable sets of 1s in binary images on the 2D Cartesian grid were introduced by Ronse in the mid-1980s to formalize the connectivity preservation conditions that parallel thinning algorithms are required to satisfy. In this paper we call these sets deletable and codeletable, respectively. To establish that a proposed parallel thinning algori...

In the 1960's Rosenfeld introduced the concepts of 8-simple and 4-simple 1's in binary images on a 2D Cartesian grid. An 8-simple 1 is a non-8-isolated 4-border 1 that can be changed to 0 without splitting any 8-connected object, and also without merging any 4-connected hole with the background or with another such hole. a, b, ..., j are some 8-simple 1's of a 2D binary image (whose 1's are the...

Let F, G and H be non-empty graphs. The notation F → (G,H) means that if any edge of F is colored by red or blue, then either the red subgraph of F con- tains a graph G or the blue subgraph of F contains a graph H. A graph F (without isolated vertices) is called a Ramsey (G,H)−minimal if F → (G,H) and for every e ∈ E(F), (F − e) 9 (G,H). The set of all Ramsey (G,H)−minimal graphs is denoted by ...

let f, g and h be non-empty graphs. the notation f → (g,h) means that if any edge of f is colored by red or blue, then either the red subgraph of f con- tains a graph g or the blue subgraph of f contains a graph h. a graph f (without isolated vertices) is called a ramsey (g,h)−minimal if f → (g,h) and for every e ∈ e(f), (f − e) 9 (g,h). the set of all ramsey (g,h)−minimal graphs is denoted by ...

‎given a finite non-cyclic group $g$‎, ‎call $sigma(g)$ the smallest number of proper subgroups of $g$ needed to cover $g$‎. ‎lucchini and detomi conjectured that if a nonabelian group $g$ is such that $sigma(g) < sigma(g/n)$ for every non-trivial normal subgroup $n$ of $g$ then $g$ is textit{monolithic}‎, ‎meaning that it admits a unique minimal normal subgroup‎. ‎in this paper we show how thi...