Dergiler / Mathematical Sciences and Applications E-Notes / 2016 / Cilt: 4 - Sayı: 1

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

Sayfa
45–54
Yayın Tarihi
2016-04-15
DOI
—
🏛️Bu makalenin bibliyografik verileri ve tam metin bağlantısı DergiPark üzerinden sağlanmıştır.
DergiPark Kaydı ↗
✨

Yapay Zeka Hızlı Bakış & Çıkarımlar

AI Insight
⚡ TL;DR(1 Cümlede Hızlı Çıkarım)

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 [∞].

📌 3 Maddede Bu Makale

🎯
Amaç & Hipotez: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 [∞].
📊
Temel Bulgular & Veri: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 [∞].
💡
Sonuç & Katkı: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 [∞].
🔬Tür:Araştırma Makalesi
📍Kapsam:Genişletilmiş Akademik Örneklem
⚙️Değişkenler:Modular group · Imprimitive action · Suborbital graph

Abstract

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 [∞].

🔖

Bu Makaleye Atıf Yap

BEŞENK, M. (2016). Connectedness of suborbital graphs for a special subgroup of the modular group. Mathematical Sciences and Applications E-Notes, Cilt: 4 - Sayı: 1, 45–54. https://ajindex.com/articles/690757

📄 Tam Metin PDF Okuyucu

📄

PDF görüntüleyici hazırlanıyor...

Kaynakça (14)

  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.