We construct infinitely many connected, circulant digraphs of outdegree three that have no hamiltonian circuit. All of our examples have an even number of vertices, and our examples are of two types: either every vertex in the digraph is adjacent to two diametrically opposite vertices, or every vertex is adjacent to the vertex diametrically opposite to itself.

for a finite group $g$‎, ‎let $cent(g)$ denote the set of centralizers of single elements of $g$‎. ‎in this note we prove that if $|g|leq frac{3}{2}|cent(g)|$ and $g$ is 2-nilpotent‎, ‎then $gcong s_3‎, ‎d_{10}$ or $s_3times s_3$‎. ‎this result gives a partial and positive answer to a conjecture raised by a‎. ‎r‎. ‎ashrafi [on finite groups with a given number of centralizers‎, ‎algebra‎ ‎collo...

the evidence suggests that emotional relationship with the opposite sex has been extended and a large group of juvenile's have experienced social relationships with the opposite sex. the basic problem of study is that how juveniles experienced consequences the relationship with the opposite sex on live? and are consequences the relationship with the opposite sex different or similarity amo...