نتایج جستجو برای: homomorphism and anti homomorphism

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

2006
Taoyang Wu

Following the last talk on graph homomorphisms, we continue to discuss some examples of graph homomorphisms. But this time we will focus on some models, that is, the homomorphism G → H for the graph H with fixed weights. The main reference is Section 1 in [2].

2001
Graham R. Brightwell Peter Winkler

We show that if a graph H is k-colorable, then (k−1)-branching walks on H exhibit long range action, in the sense that the position of a token at time 0 constrains the configuration of its descendents arbitrarily far into the future. This long range action property is one of several investigated herein; all are similar in some respects to chromatic number but based on viewing H as the range, in...

Journal: :caspian journal of mathematical sciences 2014
s.b. hosseini e. hosseinpour

the aim of this paper is to introduce and study set- valued homomorphism on lattices and t-rough lattice with respect to a sublattice. this paper deals with t-rough set approach on the lattice theory. the result of this study contributes to, t-rough fuzzy set and approximation theory and proved in several papers. keywords: approximation space; lattice; prime ideal; rough ideal; t-rough set; set...

1999
Dietmar A. Salamon

in symplectic Floer homology. Both were discovered by Donaldson. They are well defined up to an overall sign. The homomorphism (1) can be interpreted as a relative Donaldson invariant on a 4-manifold with boundary. In other words, this product is obtained by counting anti-self-dual connections over a 4-dimensional cobordism with n+ 1 cylindrical ends corresponding to Yfj . The second homomorphi...

Journal: :Pacific Journal of Mathematics 1984

2014
Madalina Croitoru

This paper presents a graph-based knowledge representation and reasoning language. This language benefits from an important syntactic operation, which is called a graph homomorphism. This operation is sound and complete with respect to logical deduction. Hence, it is possible to do logical reasoning without using the language of logic but only graphical, thus visual, notions. This paper present...

Journal: :Eur. J. Comb. 2008
Jaroslav Nesetril Robert Sámal

Tension-continuous (shortly TT ) mappings are mappings between the edge sets of graphs. They generalize graph homomorphisms. From another perspective, tension-continuous mappings are dual to the notion of flow-continuous mappings and the context of nowhere-zero flows motivates several questions considered in this paper. Extending our earlier research we define new constructions and operations f...

2005
TAKESHI MIURA

We prove that a Jordan homomorphism from a Banach algebra into a semisimple commutative Banach algebra is a ring homomorphism. Using a signum effectively, we can give a simple proof of the Hyers-Ulam-Rassias stability of a Jordan homomorphism between Banach algebras. As a direct corollary, we show that to each approximate Jordan homomorphism f from a Banach algebra into a semisimple commutative...

Journal: :European Journal of Combinatorics 2011

Journal: :Discrete Mathematics 2018

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

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