On the finite adjacent 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)
A (0,1)-graph is a simple, connected graph in which any two vertices have at most one common neighbour. The main purpose of this thesis is to classify finite bipartite (0,1)-graphs.By this purpose basic concepts are being referred in the first, second and third sections which are related to the main subject and proofs of some theorems and results from the literature are given extented. In chapter 4, some important results were obtened related to finite adjecent bipartite (0,1)-graphs.
Author
Aysel Ulukan
How to Cite
Aysel Ulukan (Doctorate thesis). On the finite adjacent bipartite graphs, 2012, Afyon Kocatepe University.
Keywords
EN
License
Tüm Hakları Saklıdır
This work is shared under the specified license terms.
More theses from Afyon Kocatepe University
- A study on the applications of viola educators on effective participations of student learning process(2019)
- An examination of the life and performance style of Mevlidhan Bilal Demiryürek(2025)
- The services of XVIIIth century Ottoman proconsuls as the Hajj Emirate(2017)
- Comparison of open and closed loop sun tracking algorithms on remote controlled (i̇nternet based) real time sun tracking systems(2018)
- Evaluation of Mavisel Yener's fairy tale books in terms of values education(2019)
- Life and pious foundations of Gedik Ahmed Pasha (D.1482)(2019)