Results 31 to 40 of about 2,112 (254)
Topological Properties of Generalized Rough Approximation Operators Based on Objects [PDF]
Jisuanji kexue, 2023 Rough set theory is a mathematical tool to deal with uncertain problems.The core notion of rough set theory is appro-ximation operators.Pawlak approximation operators based on equivalence relations cab be extended to generalized rough approximation ...
LI Yanyan, QIN Keyun
doaj +1 more source
Transitive closure and transitive reduction in bidirected graphs [PDF]
Czechoslovak Mathematical Journal, 2019 In a bidirected graph an edge has a direction at each end, so bidirected graphs generalize directed graphs. We generalize the definitions of transitive closure and transitive reduction from directed graphs to bidirected graphs by introducing new notions of bipath and bicircuit that generalize directed paths and cycles.
Abdelkader Khelladi +2 more
openaire +3 more sources
Transitive closure of interval-valued relations [PDF]
2008 3rd International Conference on Intelligent System and Knowledge Engineering, 2008 Peer ...
González del Campo, Ramón +2 more
openaire +3 more sources
On Generalized Transitive Matrices
Journal of Applied Mathematics, 2011 Transitivity of generalized fuzzy matrices over a special type of semiring is considered. The semiring is called incline algebra which generalizes Boolean algebra, fuzzy algebra, and distributive lattice.
Jing Jiang, Lan Shu, Xinan Tian
doaj +1 more source
On Invoking Transitivity to Enhance the
IEEE Access, 2018 From the earliest studies in graph theory, the phenomenon of transitivity has been used to design and analyze problems that can be mapped onto graphs. Some of the practical examples of this phenomenon are the “Transitive Closure”algorithm ...
Abdolreza Shirvani, B. John Oommen
doaj +1 more source
Spatiality of Derivations of Operator Algebras in Banach Spaces
Abstract and Applied Analysis, 2011 Suppose that A is a transitive subalgebra of B(X) and its norm closure A¯ contains a nonzero minimal left ideal I. It is shown that if δ is a bounded reflexive transitive derivation from A into B(X), then δ is spatial and implemented uniquely; that is ...
Quanyuan Chen, Xiaochun Fang
doaj +1 more source
Merotopies associated with quasi-uniformities
Applied General Topology, 2000 To an arbitrary quasi-uniformity on the set X, a merotopy on X is assigned. There are results concerning the question whether this merotopy is compatible with the topology induced by the quasi-uniformity end whether the closure operation induced by the ...
Ákos Császár
doaj +1 more source
Lattice structure of Grassmann-Tamari orders [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 The Tamari order is a central object in algebraic combinatorics and many other areas. Defined as the transitive closure of an associativity law, the Tamari order possesses a surprisingly rich structure: it is a congruence-uniform lattice.
Thomas McConville
doaj +1 more source
On the Power of Deterministic Transitive Closures
Information and Computation, 1995 AbstractWe show that transitive closure logic (FO + TC) is strictly more powerful than deterministic transitive closure logic (FO + DTC) on finite (unordered) structures. In fact, on certain classes of graphs, such as hypercubes or regular graphs of large degree and girth, every DTC-query is bounded and therefore first order expressible.
Gregory L. McColm, Erich Grädel
openaire +2 more sources
A transitive closure algorithm [PDF]
BIT Numerical Mathematics, 1970 An algorithm is given for computing the transitive closure of a directed graph in a time no greater thana1N1n+a2n2 for largen wherea1 anda2 are constants depending on the computer used to execute the algorithm,n is the number of nodes in the graph andN1 is the number of arcs (not counting those arcs which are part of a cycle and not counting those arcs
openaire +1 more source