In many real world problems, data sometimes comes from n agents (n≥2), multipolar information exists. For issues that are associated with uncertainty, this information can not be showed with the values of crisp, fuzzy, intuitionistic or bipolar. Graph is one of the mathematical models widely used in different sciences. Ambiguity in a graph where data depends on the n parameter can not be showed...

Macrodystrophia lipomatosa is a rare congenital form of localized gigantism characterized by an increase in all mesenchymal elements, particularly fibroadipose tissue. MR imaging can be used to examine the soft tissue and detect the fibrous and fatty hypertrophy that characterizes this condition and also diagnose an associated fibrolipomatous hamartoma of the median or plantar nerve. We des...

The object of the investigation is to study reducible $M$-ideals in Banach spaces. It is shown that if the number of $M$-ideals in a Banach space $X$ is $n(<infty)$, then the number of reducible $M$-ideals does not exceed of $frac{(n-2)(n-3)}{2}$. Moreover, given a compact metric space $X$, we obtain a general form of a reducible $M$-ideal in the space $C(X)$ of continuous functions on $X$. The...

Let $G$ be a graph and let $m_{ij}(G)$, $i,jge 1$, be the number of edges $uv$ of $G$ such that ${d_v(G), d_u(G)} = {i,j}$. The {em $M$-polynomial} of $G$ is introduced with $displaystyle{M(G;x,y) = sum_{ile j} m_{ij}(G)x^iy^j}$. It is shown that degree-based topological indices can be routinely computed from the polynomial, thus reducing the problem of their determination in each particular ca...

Following the idea of $L$-fuzzy neighborhood system as introduced byFu-Gui Shi, and its generalization to $(L,M)$-fuzzy neighborhood system, the relationship between  $(L,M)$-fuzzy topology and $(L,M)$-fuzzy neighborhood system will be further studied. As an application of the obtained results, we will describe the initial structures of $(L,M)$-fuzzy neighborhood subspaces and $(L,M)$-fuzzy top...

  We consider the maximal covering location-allocation problem with multiple servers. The objective is to maximize the population covered, subject to constraints on the number of service centers, total number of servers in all centers, and the average waiting time at each center. Each center operates as an M/M/k queuing system with variable number of servers. The total costs of establishing cen...