After the classification of the flag-transitive linear spaces, the attention has been turned to line-transitive linear spaces. In this article, we present a partial classification of the finite linear spaces $mathcal S$ on which an almost simple group $G$ with the socle $G_2(q)$ acts line-transitively.

after the classification of the flag-transitive linear spaces, the attention has been turned to line-transitive linear spaces. in this article, we present a partial classification of the finite linear spaces $mathcal s$ on which an almost simple group $g$ with the socle $g_2(q)$ acts line-transitively.

‎let $g=(v(g),e(g))$ be a simple connected graph with vertex set $v(g)$ and edge‎ ‎set $e(g)$‎. ‎the (first) edge-hyper wiener index of the graph $g$ is defined as‎: ‎$$ww_{e}(g)=sum_{{f,g}subseteq e(g)}(d_{e}(f,g|g)+d_{e}^{2}(f,g|g))=frac{1}{2}sum_{fin e(g)}(d_{e}(f|g)+d^{2}_{e}(f|g)),$$‎ ‎where $d_{e}(f,g|g)$ denotes the distance between the edges $f=xy$ and $g=uv$ in $e(g)$ and $d_{e}(f|g)=s...

We define an on-line (incremental) algorithm that, given a (possibly infinite) pseudo-transitive oriented graph, produces transitive reorientation. This implies that theorem of Ghouila-Houri is provable in RCA 0 and hence computably true.

With the exception of Bering's plane of order 27, all known odd order flag-transitive affine planes are one of two types: admitting a cyclic transitive action on the line at infinity, or admitting a transitive action on the line at infinity with two equal-sized cyclic orbits. In this paper we show that when the dimension over the kernel for these planes is three, then the known examples are the...

A 2&(v, k, 1) design D=(P, L) is a system consisting of a finite set P of v points and a collection L of a k-subset of P, called lines, such that each 2-subset of P is contained in precisely one line. We shall always assume that 2<k<v. Let G Aut(D) be a group of automorphisms of a 2&(v, k, 1) design D. The group G is said to be line-transitive (line-primitive, respectively) on D if G is transit...

A decomposition of a graph is a partition of the edge set. One can also look at partitions of the arc set but in this talk we restrict our attention to edges. If each part of the decomposition is a spanning subgraph then we call the decomposition a factorisation and the parts are called factors. Decompositions are especially interesting when the subgraphs induced by each part are pairwise isomo...

In this short note we discuss totally transitive maps. We show that all chaotic maps are not necessarily totally transitive, but there are chaotic maps with this property. Our discussion relates to symbol space Σ2 and real line.

A family of arc-transitive graphs is studied. The vertices of these graphs are ordered pairs of distinct points from a finite projective line, and adjacency is defined in terms of the cross ratio. A uniform description of the graphs is given, their automorphism groups are determined, the problem of isomorphism between graphs in the family is solved, some combinatorial properties are explored, a...