نتایج جستجو برای: transitive
تعداد نتایج: 8005 فیلتر نتایج به سال:
The publication of knowledge graphs on the Web in form RDF datasets, and subsequent integration such are both essential to idea Linked Open Data. Combining can result undesirable graph structures even logical inconsistencies. Refinement methods that detect repair therefore crucial importance. Existing refinement for often domain-specific, limited single relations (e.g. owl:sameAs), or scale. We...
Let D be a digraph, V (D) and A(D) will denote the sets of vertices and arcs of D, respectively. A (k, l)-kernel N of D is a k-independent (if u, v ∈ N then d(u, v), d(v, u) ≥ k) and l-absorbent (if u ∈ V (D) − N then there exists v ∈ N such that d(u, v) ≤ l) set of vertices. A k-kernel is a (k, k − 1)-kernel. A digraph D is transitive if (u, v), (v, w) ∈ A(D) implies that (u,w) ∈ A(D). This co...
A subgroup G of automorphisms of a graph X is said to be 1 2-transitive if it is vertex and edge but not arc-transitive. The graph X is said to be 1 2-transitive if Aut X is 1 2-transitive. The graph X is called one-regular if Aut X acts regularly on the set arcs of X. The interplay of three diierent concepts of maps, one-regular graphs and 1 2-transitive group actions on graphs of valency 4 is...
The theory of vertex-transitive graphs has developed in parallel with the theory of transitive permutation groups. In this chapter we explore some of the ways the two theories have influenced each other. On the one hand each finite transitive permutation group corresponds to several vertex-transitive graphs, namely the generalised orbital graphs which we shall discuss below. On the other hand, ...
An interesting fact is that almost all the connected 2-arc-transitive nonnormal Cayley graphs on nonabelian simple groups with small valency or prime (provided solvable vertex stabilizers) are alternating An. This naturally motivates study of for arbitrary valency. In this paper, we characterize automorphism such graphs. particular, show a non-complete (G,2)-arc-transitive graph G simple, socle...
Weakly s-arc transitive graphs are introduced and determined. A graph is said to be weakly s-arc transitive if its endomorphism monoid acts transitively on the set of s-arcs. The main results are: (1) A nonbipartite graph is weakly s-arc transitive if and only if it is s-arc transitive. (2) A tree with diameter d is weakly s-arc transitive for all 0 s d. (3) A bipartite graph with girth g = 2s ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید