Connectedness of suborbital graphs for a special subgroup of the modular group

Yıl 2016, Cilt: 4 Sayı: 1, 45 - 54, 15.04.2016

Murat Beşenk

https://doi.org/10.36753/mathenot.421401

Cited By: 1

Öz

In this paper, we investigate connectedness of suborbital graphs for a special congruence subgroups.Firstly,
conditions for being an edge self-paired are provided, then in order to make graph connected, we give
necessary and sufficient conditions for the £u,n, whose vertices form the block [∞].

Anahtar Kelimeler

Modular group, Imprimitive action, Suborbital graph, Connectedness

Kaynakça

• [1] Jones, G. A., Singerman, D. and Wicks, K.,The modular group and generalized Farey graphs. London Mathematical Society Lecture Note Series. 160 (1991), 316-338.
• [2] Akba¸s, M.,On suborbital graphs for the modular group. Bulletin London Mathematical Society. 33 (2001), 647-652.
• [3] Bigg, N.L. and White, A.T., Permutation groups and combinatorial structures. London Mathematical Society Lecture Note Series 33. Cambridge University Press, Cambridge, 1979.
• [4] Sims, C.C., Graphs and finite permutation groups. Mathematische Zeitschrift. 95 (1967),76-86.
• [5] Jones, G. A. and Singerman, D., Complex functions: an algebraic and geometric viewpoint. Cambridge University Press, Cambridge, 1987.
• [6] Schoeneberg, B., Elliptic modular functions. Springer, Berlin, 1974.
• [7] Newman, M., Classification of normal subgroups of the modular group.American journal of Mathematics. 126 (1967), 267-277.
• [8] Tsuzuku, T., Finite Groups and Finite Geometries. Cambridge University Press, Cambridge, 1982.
• [9] Dixon, J.D. and Mortimer, B., Permutation groups. Springer-Verlag, New York, 1996.
• [10] Hardy, G.H. and Wright, E.M., An introduction to the theory of numbers. Oxford University Press, Oxford, 1979.
• [11] Rankin, R.A., Modular forms and functions. Cambridge University Press, Cambridge, 2008.
• [12] Kesicioğlu, Y., Akba¸s, M. and Beşenk, M., Connectedness of a suborbital graph for congruence subgroups. Journal of Inequalities and Applications. 1 (2013), 117-124.
• [13] Güler, B.Ö., Beşenk, M., Değer, A.H. and Kader, S., Elliptic elements and circuits in suborbital graphs. Hacettepe Journal of Mathematics and Statistics. 40 (2011),no. 2, 203-210.
• [14] Beşenk, M., Güler, B.Ö., Değer, A.H. and Kesicioğlu, Y., Circuit lengths of graphs for the Picard gorup. Journal of Inequalities and Applications. 1 (2013), 106-114.