نتایج جستجو برای: center steiner harary index
تعداد نتایج: 670387 فیلتر نتایج به سال:
This paper deals with the implementation of Steiner point of fuzzy set. Some definitions and properties of Steiner point are investigated and extended to fuzzy set. This paper focuses on establishing efficient methods to compute Steiner point of fuzzy set. Two strategies of computing Steiner point of fuzzy set are proposed. One is called linear combination of Steiner points computed by a series...
When a wide polygonal dural window is created, a short dural incision length is preferred by surgeons because suturing a wastefully long incision line during closure is troublesome. A locator to facilitate making the shortest dural incision when creating a polygonal dural window would be helpful. We geometrically analyzed the shortest incision design for a pentagonal dural window and produced a...
The topological indices, defined as the sum of contributions of all pairs of vertices (among which are the Wiener, Harary, hyper–Wiener indices, degree distance, and many others), are expressed in terms of contributions of edges and pairs of edges.
در این پایان نامه به بررسی ایدآل های اوّل و ابتدائی فازی و رادیکال های آنها می پردازیم. ابتدا به تعاریف اصلی و نتایج منطق فازی در فصل اوّل اشاره می کنیم و در فصل دوم به تعاریف و قضایای مربوط به مجموعه ها و ایدآل های فازی پرداخته، درنهایت در فصل سوم خصوصیات ایدآل های ابتدائی فازی ورادیکال آنها درحلقه های تعویض پذیرمورد بحث و بررسی قرارمی گیرد. ایدآل $a$ از $r$ ایدآل ابتدائی فازی است اگر برا...
Given a point set K of terminals in the plane, the octilinear Steiner tree problem is to find a shortest tree that interconnects all terminals and edges run either in horizontal, vertical, or ±45 diagonal direction. This problem is fundamental for the novel octilinear routing paradigm in VLSI design, the socalled X-architecture. As the related rectilinear and the Euclidian Steiner tree problem ...
Topological indices are the numerical value associated with chemical constitution purporting for correlation of chemical structure with various physical properties, chemical reactivity or biological activity. Graph theory is a delightful playground for the exploration of proof techniques in Discrete Mathematics and its results have applications in many areas of sciences. One of the useful indic...
We analyse the results of our experimental laboratory approximation of motorways networks with slime mould Physarum polycephalum. Motorway networks of fourteen geographical areas are considered: Australia, Africa, Belgium, Brazil, Canada, China, Germany, Iberia, Italy, Malaysia, Mexico, The Netherlands, UK, USA. For each geographical entity we represented major urban areas by oat flakes and ino...
This thesis introduces the Steiner connectivity problem. It is a generalization of the well known Steiner tree problem. Given a graph G = (V,E) and a subset T ⊆ V of the nodes, the Steiner tree problem consists in finding a cost minimal set of edges connecting all nodes in T . The Steiner connectivity problem chooses, instead of edges, from a given set of paths a subset to connect all nodes in ...
In this paper, we initiate the study of designing approximation algorithms for FaultTolerant Group-Steiner (FTGS) problems. The motivation is to protect the well-studied group-Steiner networks from edge or vertex failures. In Fault-Tolerant Group-Steiner problems, we are given a graph with edge(or vertex-) costs, a root vertex, and a collection of subsets of vertices called groups. The objectiv...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید