نتایج جستجو برای: linear order homomorphism
تعداد نتایج: 1324998 فیلتر نتایج به سال:
We fully characterise the situations where the existence of a homomorphism from a digraph G to at least one of a finite set H of directed graphs is determined by a finite number of forbidden subgraphs. We prove that these situations, called generalised dualities, are characterised by the non-existence of a homomorphism to G from a finite set of forests. Furthermore, we characterise all finite m...
let $g$ be a finite group. we construct the prime graph of $ g $,which is denoted by $ gamma(g) $ as follows: the vertex set of thisgraph is the prime divisors of $ |g| $ and two distinct vertices $ p$ and $ q $ are joined by an edge if and only if $ g $ contains anelement of order $ pq $.in this paper, we determine finite groups $ g $ with $ gamma(g) =gamma(l_3(q)) $, $2 leq q < 100 $ and prov...
The purpose of this paper is to present explicitly the solution curve for commutative affine control systems on Lie groups under assumption that automorphisms associated with linear vector fields commutes. If we assume derivations system are inner, obtain a simpler and show some results controllability. To finish, work conjugation by homomorphism between systems.
Computational and model-theoretic properties of logical languages constitute a central field of research in logic-based knowledge representation. Datalog is a very popular formalism, a de-facto standard for expressing and querying knowledge. Diverse results exist regarding the expressivity of Datalog and its extension by input negation (semipositive Datalog) and/or a linear order (orderinvarian...
In this talk we will discuss some examples of graph homomorphisms. More precisely, the graph parameters which can be represented by counting the graph homomorphisms. The main reference is Section 2 in [2].
For a graph G, let max : is an edge cut of b G D D G . For graphs G and H, a map :V G V H is a graph homomorphism if for each e uv E G , u v E H . In 1979, Erdös proved by probabilistic methods that for p ≥ 2 with
A graph homomorphism is a vertex map which carries edges from a source graph to edgesin a target graph. The instances of the Weighted Maximum H-Colourable Subgraph problem(MAX H -COL) are edge-weighted graphs G and the objective is to find a subgraph of G that hasmaximal total edge weight, under the condition that the subgraph has a homomorphism to H ;note that for H = Kk th...
in this paper we will prove that the simple group g2(q) where 2 < q = 1(mod3)is recognizable by the set of its order components, also other word we prove that if g is anite group with oc(g) = oc(g2(q)), then g is isomorphic to g2(q).
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید