Let s be a positive integer. A graph is s-transitive if its automorphism group is transitive on s-arcs but not on (s + 1)-arcs. Let p be a prime. In this article a complete classification of tetravalent s-transitive graphs of order 3p is given.

A polynomial P (x) with integer coefficients is said to be transitive modulo m, if for every x, y ∈ Z there exists k ≥ 0 such that P (x) = y (mod m). In this paper, we construct new examples of transitive polynomials modulo prime powers and partially describe cubic and quartic transitive polynomials. We also study the orbit structure of affine maps modulo prime powers.

We propose several variant setups to combine statistical translation models for transitive translation. Transitive translation could be a useful technique to enlarge the number of supported language pairs for a cross language information retrieval (CLIR) system in a cost-effective manner. The transitive CLIR models were evaluated on the CLEF test collection and yielded a retrieval effectiveness...

A 1 2 -arc-transitive graph is a vertexand edgebut not arc-transitive graph. In all known constructions of quartic 1 2 -arc-transitive graphs, vertex stabilizers are isomorphic to Z 2,Z 2 2 or to D8. In this article, for each positive integer m ≥ 1, an infinite family of quartic 1 2 -arctransitive graphs having vertex stabilizers isomorphic to Z m

A fast method to compute a T-transitive opening of a proximity is given for any tnorm, spending O(n) time. Even though there is not a unique T-transitive approximation of a fuzzy relation, it is proved that the computed T-transitive opening is maximal.

Transitive tournament (including transitive triangle) and its blow-up have some symmetric properties. In this work, we establish an analogue result of the Erdös-Stone theorem weighted digraphs with a forbidden tournament. We give stability oriented graphs triangles show that almost all are bipartite, which reconfirms strengthens conjecture Cherlin.

We classify the transitive and co-transitive blocking sets in a finite Desarguesian plane.

A graph is said to be half-arc-transitive if its automorphism group acts transitively on the set of its vertices and edges but not on the set of its arcs. With each half-arc-transitive graph of valency 4 a collection of the so called alternating cycles is associated, all of which have the same even length. Half of this length is called the radius of the graph in question. Moreover, any two adja...