Some special integer sequences related to bipartite graphs
Is this your thesis?
This record came from a bulk archive import. If it’s yours, link it to your profile.
Abstract (EN)
In this thesis, we consider some certain types of bipartite graphs whose bipartite adjacency matrices are the n × n (0, 1)−matrices. Then we show that the numbers of perfect matchings (1−factors) of these bipartite graphs are equal to the famous integer sequences (e.g. Fibonacci, Lucas, Jacobsthal). After that, we give some examples concerned with these graphs and their perfect matchings. Finally, we present Maple procedures in order to calculate the numbers of perfect matchings of the bipartite graphs.
Author
Dıyar Omar Mustafa Zangana
How to Cite
Dıyar Omar Mustafa Zangana (Master Thesis). Some special integer sequences related to bipartite graphs, 2017, Siirt University.
Keywords
License
Tüm Hakları Saklıdır
This work is shared under the specified license terms.
More theses from Siirt University
- Determine of the levels of the school principal to fulfill the supervisory duties(2019)
- Determination of active ingredient in the Cynara scolymus L. artichoke species with Cynara syriaca B. species growing naturally in Siirt region(2019)
- Evaluation of soil quality with different methods in upper tigris basin where intensive agricultural production is performed(2019)
- Examination of organizational deviation levels in schools according to teacher perceptions(2019)
- The relationship between organizational policy perception of schools and Herzberg's double factor hygiene motivation theory(2019)
- Relation between the levels of political skill of school administrators and their skills of using informal communication(2019)