ON DEGREES OF END NODES AND CUT NODES IN FUZZY GRAPHS
نویسندگان
چکیده مقاله:
The notion of strong arcs in a fuzzy graph was introduced byBhutani and Rosenfeld in [1] and fuzzy end nodes in the subsequent paper[2] using the concept of strong arcs. In Mordeson and Yao [7], the notion of“degrees” for concepts fuzzified from graph theory were defined and studied.In this note, we discuss degrees for fuzzy end nodes and study further someproperties of fuzzy end nodes and fuzzy cut nodes.
منابع مشابه
on degrees of end nodes and cut nodes in fuzzy graphs
the notion of strong arcs in a fuzzy graph was introduced bybhutani and rosenfeld in [1] and fuzzy end nodes in the subsequent paper[2] using the concept of strong arcs. in mordeson and yao [7], the notion of“degrees” for concepts fuzzified from graph theory were defined and studied.in this note, we discuss degrees for fuzzy end nodes and study further someproperties of fuzzy end nodes and fuzz...
متن کاملFront − End Nodes Back − End Nodes SWITCH
Daniel M. Dias William Kish Rajat Mukherjee and Renu Tewari IBM Research Division T. J. Watson Research Center P.O. Box 704, Yorktown Heights, NY 10598 fdias, c1kish, rajatm, c1renu [email protected] Abstract We describe a prototype scalable and highly available web server, built on an IBM SP-2 system, and analyze its scalability. The system architecture consists of a set of logical front-end or...
متن کاملUniversal dependence of distances on nodes degrees in complex networks
We have studied dependence of distances on nodes degrees between vertices of ErdősRényi random graphs, scale-free Barabási-Albert models, science collaboration networks, biological networks, Internet Autonomous Systems and public transport networks. We have observed that the mean distance between two nodes of degrees ki and k j equals to 〈li j〉 = A−B log(kik j). A simple heuristic theory for th...
متن کاملLabeling Nodes Using Three Degrees of Propagation
The properties (or labels) of nodes in networks can often be predicted based on their proximity and their connections to other labeled nodes. So-called "label propagation algorithms" predict the labels of unlabeled nodes by propagating information about local label density iteratively through the network. These algorithms are fast, simple and scale to large networks but nonetheless regularly pe...
متن کاملQuick Detection of Nodes with Large Degrees
Our goal is to quickly find top k lists of nodes with the largest degrees in large complex networks. If the adjacency list of the network is known (not often the case in complex networks), a deterministic algorithm to find the top k list of nodes with the largest degrees requires an average complexity of O(n), where n is the number of nodes in the network. Even this modest complexity can be ver...
متن کاملGraphs with equidistant central nodes
An F-graph is a graph G whose center C (G) contains at least two nodes, and the distance between any two nodes of C(G) equals the radius of G. In this paper we study properties of these and describe some of them. INTRODUCTION One of the problems frequently studied in the of is the problem of facility location in central nodes. Some emergency facilities located in the same can interfere with oth...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 1 شماره 1
صفحات 57- 64
تاریخ انتشار 2004-04-22
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
کلمات کلیدی
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023