Sirküler grafların temel özellikleri üzerine

Abstract

Sirküler uzayların çakışım grafları olarak görünen sirküler graflar, projektif geometride herhangi bir ayrık yapının, onu iki parçalı graf modeli olarak tanımlayarak incelenebileceğini kanıtlamıştır. Bu çalışmada, sirküler grafların bazı temel özellikleri incelenerek kısmen sınıflandırılmıştır. Verilen grafların sirküler olup olmadığını Derinlik Öncelikli Arama (DFS) algoritması kullanarak belirleyen Java kaynak kodu verilmiştir.

Keywords

• iki kümeli graf
• graf teorisi
• sirküler graf

On The Fundamental Properties of Circular Graphs

Abstract

Circular graphs, which appear as incidence graphs of circular spaces, demonstrate that any discrete structure in projective geometry can be studied by defining it as a bipartite graph model. In this study, circular graphs are partially classified by examining some of their basic properties. Java source code that determines whether the given graphs are circular using the Depth-First Search (DFS) algorithm is provided.

Keywords

• Bipartite graph
• graph theory
• circular graph.

References

1. [1] A.S. Asratian, T.M.J. Denley and R. Hoggkvist, Bipartite graphs and their applications, Cambridge Uni, United Kingdom. Press,1998.
2. [2] R. Sunar and İ. Günaltılı, “On The Basic Properties of Linear Graphs - I”, Konuralp J. Math., vol. 9, no. 1, pp. 154-158, 2021.
3. [3] İ. Günaltılı, A. Ulukan, and Ş . Olgun, “Some Properties Of Fınıte f0,1g-Graphs” , Konuralp Journal Of Mathematics,1(1), pp. 34-39, 2013.
4. [4] F. Harary, D. Hsu and Z. Miller, “The biparticity of a graph”, J. Graph Theory 1, pp. 131-133, 1977..
5. [5] M. Mulder, “(0, l)-graph and n-cubes”, Discrete mathematics vol. 28, pp. 179-188 1979.
6. [6] D.B. West, “Introduction to Graph Theory”, Prentice-Hall, Englewood Clins, NJ, 1996.
7. [7] C. Vasudev, Combinatorics and Graph Theory, New Age Publications(Academic), India, 2007.
8. [8] L.M. Batten, Combinatorics of finite geometries ,Cambridge University Press, Cambridge-NewYork, 1986.

9. [9] Günaltılı,İ.; Akça,Z. And Olgun,Ş., APPS. Applied Sciences, vol. 8, no. 1, pp. 85-90, 2006.
10. [10] Levi, F. W., 1942, Finite geometrical systems, at the University of Calcutta, University of Calcutta, six public lectues delivered in February, 1940
11. [11] König, D. “Line systems and determinants”, Math. Termész. Ert, vol. 33, pp. 221-229, 1915.
12. [12] König, D., “Über graphen und ihre anwendung auf determinantentheorie und Mengenlehre”. Mathematische Annalen, vol. 77, no. 4, pp. 453-465, 1916.
13. [13] Sorgun,S., Ertaş, A. G., Günaltılı, I., On the incidence graph of circular spaces, Electronic Journal of Graph Theory and Applications, vol. 12, no. 2, pp. 379-386, 2024.