The radio antipodal number of a graph $G$ is the smallest integer $c$ such that there exists an assignment $fV\left(G\right)\to \{1,2,...,c\}$ satisfying $\left|f\right(u)-f(v\left)\right|\ge D-d(u,v)$ for every two distinct vertices $u$ and $v$ of $G$, where $D$ is the diameter of $G$. In this note we determine the exact value of the antipodal number of the path, thus answering the conjecture given in [G. Chartrand, D. Erwin and P. Zhang, Math. Bohem. 127 (2002), 57–69]. We also show the connections between this colouring and radio labelings.

For any positive integer k and any set A of nonnegative integers, let $r_{1,k}(A,n)$ denote the number of solutions (a₁,a₂) of the equation n = a₁ + ka₂ with a₁,a₂ ∈ A. Let k,l ≥ 2 be two distinct integers. We prove that there exists a set A ⊆ ℕ such that both $r_{1,k}(A,n)=r_{1,k}(\mathbb{N}\setminus A,n)$ and $r_{1,l}(A,n)=r_{1,l}(\mathbb{N}\setminus A,n)$ hold for all n ≥ n₀ if and only if log k/log l = a/b for some odd positive integers a,b, disproving a conjecture of Yang. We also show that for any set A ⊆ ℕ satisfying $r_{1,k}(A,n)=r_{1,k}(\mathbb{N}\setminus A,n)$ for all n ≥ n₀, we have $r_{1,k}(A,n)\to \infty$ as n → ∞.

We prove that a rank $\ge 3$ Dowling geometry of a group $H$ is partition representable if and only if $H$ is a Frobenius complement. This implies that Dowling group geometries are secret-sharing if and only if they are multilinearly representable.

A graph $X$, with a group $G$ of automorphisms of $X$, is said to be $(G,s)$-transitive, for some $s\ge 1$, if $G$ is transitive on $s$-arcs but not on $(s+1)$-arcs. Let $X$ be a connected $(G,s)$-transitive graph of prime valency $p\ge 5$, and $G_v$ the vertex stabilizer of a vertex $v\in V\left(X\right)$. Suppose that $G_v$ is solvable. Weiss (1974) proved that $|G_v{|\mid p(p-1)}^2$. In this paper, we prove that $G_v\cong ({\mathbb{Z}}_p⋊{\mathbb{Z}}_m)\times {\mathbb{Z}}_n$ for some positive integers $m$ and $n$ such that $ndivm$ and $m\mid p-1$.

Strongly perfect graphs were introduced by C. Berge and P. Duchet in [1]. In [4], [3] the following was studied: the problem of strong perfectness for the Cartesian product, the tensor product, the symmetrical difference of n, n ≥ 2, graphs and for the generalized Cartesian product of graphs. Co-strong perfectness was first studied by G. Ravindra andD. Basavayya [5]. In this paper we discuss strong perfectness and co-strong perfectness for the generalized composition (the lexicographic product)...