نتایج جستجو برای: lexicographic product
تعداد نتایج: 282346 فیلتر نتایج به سال:
A graph structure is a useful tool in solving the combinatorial problems in different areas of computer science and computational intelligence systems. A bipolar fuzzy graph structure is a generalization of a bipolar fuzzy graph. In this paper, we present several different types of operations, including composition, Cartesian product, strong product, cross product, and lexicographic product on ...
We present some results on the growth in various products of graphs. In particular we study the Cartesian, strong, lexicographic, tensor and free product of graphs. We show that with respect to distances the tensor product behaves differently from other products. In general the results are valid for rooted graphs but have especially nice structure in the case of vertex-transitive factors.
The partition of indeterminacy function the neutrosophic set into contradiction part and ignorance represent quadripartitioned single valued set. In this work, new concept bipolar graph is established, operations on it are studied. Cartesian product, cross lexicographic strong product composition investigated. proposed concepts illustrated with examples.
Comfortability is one of the important attributes (characteristics) for a successful team work in any organization. It is necessary to find a comfortable and successful team in any given social network. We have introduced “comfortability” as a new SNA index. Comfortable team exists only in some social networks. In this paper, we analyze the existence of comfortable team in product graphs, such ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید