نتایج جستجو برای: center-like subset
تعداد نتایج: 1007601 فیلتر نتایج به سال:
we introduce center-like subsets z*(r,f), z**(r,f) and z1(r,f), where r is a ring and f is a map from r to r. for f a derivation or a non-identity epimorphism and r a suitably-chosen prime or semiprime ring, we prove that these sets coincide with the center of r.
We introduce center-like subsets Z*(R,f), Z**(R,f) and Z1(R,f), where R is a ring and f is a map from R to R. For f a derivation or a non-identity epimorphism and R a suitably-chosen prime or semiprime ring, we prove that these sets coincide with the center of R.
The main purpose of this paper is to introduce several concepts of the metric-like spaces. For instance, we define concepts such as equal-like points, cluster points and completely separate points. Furthermore, this paper is an attempt to present compatibility definitions for the distance between a point and a subset of a metric-like space and also for the distance between two subsets of a metr...
Let G be a group. Neumann to answer a question of Paul Erdos proved that every infinite subset of G has two different comuting elements if and only if G is center-by-finite. In this paper, we deal with Erdoschr('39')s question in different aspect and we show that every infinite subset X of G has two different elements x and y such that x^y=1 if and only if the exterior center of G ihas finit...
We study the properties of certain center-like subsets of groups, which are obtained by localizing setwise commutativity conditions. 1. Introduction. Let G denote a group with center Z = Z(G); and for each subset A of G, denote by C(A) the centralizer of A in G. In this paper, we define several " center-like " subsets of G, investigate their properties and establish conditions for them to coinc...
an extended star is a tree which has only one vertex with degree larger than two. the -center problem in a graph asks to find a subset of the vertices of of cardinality such that the maximum weighted distances from to all vertices is minimized. in this paper we consider the -center problem on the unweighted extended stars, and present some properties to find solution.
Let $G$ be a bipartite graph. In this paper we consider the two kind of location problems namely $p$-center and $p$-median problems on bipartite graphs. The $p$-center and $p$-median problems asks to find a subset of vertices of cardinality $p$, so that respectively the maximum and sum of the distances from this set to all other vertices in $G$ is minimized. For each case we present some proper...
An extended star is a tree which has only one vertex with degree larger than two. The -center problem in a graph asks to find a subset of the vertices of of cardinality such that the maximum weighted distances from to all vertices is minimized. In this paper we consider the -center problem on the unweighted extended stars, and present some properties to find solution.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید