نتایج جستجو برای: transitive soft sets

تعداد نتایج: 340917  

Journal: :Journal of Combinatorial Theory, Series A 2000

Journal: :Electr. J. Comb. 2013
David E. Roberson

A core of a graph X is a vertex minimal subgraph to which X admits a homomorphism. Hahn and Tardif have shown that for vertex transitive graphs, the size of the core must divide the size of the graph. This motivates the following question: when can the vertex set of a vertex transitive graph be partitioned into sets each of which induce a copy of its core? We show that normal Cayley graphs and ...

2011
Jose Luis Patino Murray Evans James M. Ferryman François Brémond Monique Thonnat

In this work we present a novel approach for activity extraction and knowledge discovery from video employing fuzzy relations. Spatial and temporal properties from detected mobile objects are modeled with fuzzy relations. These can then be aggregated employing typical soft-computing algebra. A clustering algorithm based on the transitive closure calculation of the fuzzy relations allows finding...

2011
Bivas Dinda T. K. Samanta

In this paper, we present the concept of relations in intuitionistic fuzzy soft set and study some of their properties and also discuss symmetric, transitive and reflexive intuitionistic fuzzy soft relations.

2017
Allison Beemer Christine A. Kelley

We present a novel multidimensional network model as a means to analyze decoder failure and characterize trapping sets of graphbased codes. We identify a special class of these decoding networks, which we call transitive networks, and show how they may be used to identify trapping sets and inducing sets. Many codes have transitive decoding network representations. We conclude by investigating t...

Journal: :J. Philosophical Logic 2004
Luca Alberucci Vincenzo Salipante

A finitary characterization for non-well-founded sets with finite transitive closure is established in terms of a greatest fixpoint formula of the modal μ-calculus. This generalizes the standard result in the literature where a finitary modal characterization is provided only for wellfounded sets with finite transitive closure. The proof relies on the concept of automaton, leading then to new i...

Journal: :Journal of Combinatorial Theory, Series A 2012

Journal: :Communications of the Korean Mathematical Society 2012

In this paper we introduce the concept of $(1,2)^*$-sb-separated sets and $(1,2)^*$-soft b-connected spaces and prove some properties related to these break topics. Also we disscused the properties of $(1,2)^*$-soft b- compactness in soft bitopological space

Journal: :Publications mathématiques de l'IHÉS 2006

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید