Projective Graphs Obtained from Projective Planes
Abstract
In this paper, we introduced a new method to relate two areas, graph theory and projective geometry that have a long history and very deep theories. We investigated the combinatorial properties of the graphs which are obtained from finite projective planes by using this new method. Also, we examined the relations between these combinatorial properties and the order of the projective plane.
Keywords
References
- [1] Aigner, M., Triesch, E.: Realizability and uniqueness in graphs, Discrete Math., 136, 3--20 (1994).
- [2] Barrus, M. D., Donovan, E.: Neighborhood degree lists of graphs, Discrete Math., 341 (1), 175--183 (2018).
- [3] Bondy A., Murty M. R.: Graph Theory, Springer-Verlag, London, (2008).
- [4] Cangul. N.: Graf Teori-I, Temel Konular, Dora Yayınları, Bursa, (2017).
- [5] Choudum, S. A.: On forcibly connected graphic sequences, Discrete Math., 96, 175--181 (1991),
- [6] Hakimi, S. L.: On the realizability of a set of integers as degrees of the vertices of a graph, J. SIAM Appl. Math., 10, 496-506 (1962).
- [7] Havel, V.: A remark on the existence of finite graphs (Czech), Casopic Pěst. Mat., 80, 477--480 (1955).
- [8] Hughes D. R., Piper F. C.: Projective Planes, Springer, New York, (1973).
Details
Primary Language
English
Subjects
Engineering
Journal Section
Research Article
Publication Date
December 28, 2018
Submission Date
August 17, 2018
Acceptance Date
January 2, 2019
Published in Issue
Year 2018 Volume: 8 Number: 2