Circuit lengths of graphs for the Picard group

Creative Commons License

Besenk M., GÜLER B. Ö., DEĞER A. H., Kesicioglu Y.

JOURNAL OF INEQUALITIES AND APPLICATIONS, 2013 (SCI-Expanded) identifier identifier


In this paper, we examine some properties of suborbital graphs for the Picard group. We obtain edge and circuit conditions, then propose a conjecture for the graph to be forest. This paper is an extension of some results in (Jones et al. in The Modular Group and Generalized Farey Graphs, pp. 316-338, 1991).