منابع مشابه
Some Connectivity Concepts in Bipolar Fuzzy Graphs
In this article, we introduce some connectivity concepts in bipolar fuzzy graphs. Analogous to fuzzy cutvertices and fuzzy bridges in fuzzy graphs, bipolar fuzzy cutvertices and bipolar fuzzy bridges are introduced and characterized. We also propose the concepts of gain and loss for paths and pairs of vertices. Connectivity in complete bipolar fuzzy graphs is also discussed.
متن کاملSome special minimum k-geodetically connected graphs
A connected graph G is k-geodetically connected (k-GC) if the removal of less than k vertices does not affect the distances (lengths of the shortest paths) between any pair of the remaining vertices. As such graphs have important applications in robust system designs, we are interested in theminimumnumber of edges required tomake a k-GC graph of order n, and characterizing those minimum k-GC gr...
متن کاملSome Remarks on Complement of Fuzzy Graphs
Fuzzy Graphs are having numerous applications in problems like Network analysis, Clustering, Pattern Recognition and Neural Networks. The analysis of properties of fuzzy graphs has facilitated the study of many complicated networks like Internet. In this paper we study the structures of complement of many important fuzzy graphs such as Fuzzy cycles, Blocks etc. The complement of fuzzy graphs wi...
متن کاملSelective Graph Coloring in Some Special Classes of Graphs
In this paper, we consider the selective graph coloring problem. Given an integer k ≥ 1 and a graph G = (V,E) with a partition V1, . . . , Vp of V , it consists in deciding whether there exists a set V ∗ in G such that |V ∗ ∩ Vi| = 1 for all i ∈ {1, . . . , p}, and such that the graph induced by V ∗ is k-colorable. We investigate the complexity status of this problem in various classes of graphs.
متن کاملRoman domination in some special classes of graphs
A Roman dominating function of a graph G = (V, E) is a function f : V → {0, 1, 2} such that every vertex x with f(x) = 0 is adjacent to at least one vertex y with f(y) = 2. The weight of a Roman dominating function is defined to be f(V ) = P x∈V f(x), and the minimum weight of a Roman dominating function on a graph G is called the Roman domination number of G. In this paper we answer an open pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fuzzy Information and Engineering
سال: 2016
ISSN: 1616-8658,1616-8666
DOI: 10.1016/j.fiae.2016.03.003