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 İndekslerine Giren Dergi) identifier identifier

  • Cilt numarası:
  • Basım Tarihi: 2013
  • Doi Numarası: 10.1186/1029-242x-2013-106
  • Dergi Adı: JOURNAL OF INEQUALITIES AND APPLICATIONS

Özet

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).