Abstract
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). © 2013 Be?senk et al.
Cite
CITATION STYLE
APA
Beşenk, M., Guler, B. Ö., Deǧer, A. H., & Kesicioǧlu, Y. (2013). Circuit lengths of graphs for the Picard group. Journal of Inequalities and Applications, 2013. https://doi.org/10.1186/1029-242X-2013-106
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free