In two papers published as Technical Reports at the Rose-Hulman Institute of Technology the idea of a cyclicizer of an element was introduced. For an element , is cyclic . For a subset , is defined to be the intersection of the cyclicizers of the elements of . Note that , the cyclicizer of . Trivially .
The paper is organised in eight sections. The second contains some basic facts about cyclicizers and discusses some results about non-locally-cyclic groups with . The authors introduce the non-cyclic graph of a group , , this is defined to have vertices with two vertices and joined if is not cyclic. In Section 3 they show that is connected and that the diameter is at most 3, and the example they give of a group with diameter 3 is a direct product of the symmetric group of degree 6 and the cyclic group of order 6. It is curious that such a restriction on diameters is not uncommon in graphs defined by groups.
There is an alternative graph, the non-commuting graph defined to have vertices with two vertices and joined if , this is a subgraph of the non-cyclic graph. The non-commuting graph was studied by B. H. Neumann [J. Aust. Math. Soc., Ser. A 21, 467-472 (1976; Zbl 0333.05110)]. In this paper he showed that the graph contains no infinite cliques if and only if is cyclic. They show that the equivalent result holds for the non-cyclic graph, that is has no cliques if and only if is cyclic.
The last two sections consider the interesting problem of when uniquely determines the group, though even the general question of the order for finite groups is not answered. It should be noted that this only makes sense for groups which are not locally cyclic. They give a number of results which discuss special cases. One of which leads to a conjecture of Goormaghtigh on numbers of the form .