| Well-totally-dominated graphs S Bahadır, T Ekim, D Gözüpek arXiv preprint arXiv:2010.02341, 2020 | 4 | 2020 |
| On graphs all of whose total dominating sequences have the same length S Bahadır, D Gözüpek, O Doğan Discrete Mathematics 344 (9), 112492, 2021 | 3 | 2021 |
| On a class of graphs with large total domination number S Bahadır, D Gözüpek Discrete Mathematics & Theoretical Computer Science 20 (Graph Theory), 2018 | 3 | 2018 |
| ON THE NUMBER OF REFLEXIVE AND SHARED NEAREST NEIGHBOR PAIRS IN ONE-DIMENSIONAL UNIFORM DATA S Bahadır, E Ceyhan PROBABILITY AND MATHEMATICAL STATISTICS 38 (1), 123-137, 2018 | 3 | 2018 |
| Nearest neighbor methods for testing reflexivity E Ceyhan, S Bahadır Environmental and ecological statistics 24, 69-108, 2017 | 3 | 2017 |
| An algorithm to check the equality of total domination number and double of domination number in graphs S Bahadir Turkish Journal of Mathematics 44 (5), 1701-1707, 2020 | 2 | 2020 |
| On total domination and minimum maximal matchings in graphs S Bahadır Quaestiones Mathematicae 46 (6), 1119-1129, 2023 | 1 | 2023 |
| On the Number of Weakly Connected Subdigraphs in Random kNN Digraphs S Bahadır, E Ceyhan Discrete & Computational Geometry, 2020 | 1 | 2020 |
| A Classification of Isomorphism-Invariant Random Digraphs S Bahadır, E Ceyhan arXiv preprint arXiv:1605.02087, 2016 | | 2016 |
| A probabilistic investigation of k nearest neighbor directed graphs S Bahadir Fen Bilimleri Enstitüsü, 2016 | | 2016 |
Elvan CeyhanAuburn UniversityVerified email at auburn.edu
