Circuit lengths of graphs for the Picard group
Citation
Besenk, M., Guler, B.O., Deger, A.H., Kesicioglu, Y., (2013).Circuit lengths of graphs for the Picard group.Journal of Inequalities and Applications, 106.https://doi.org/10.1186/1029-242X-2013-106Abstract
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).
