Site Header — ASOIU Mathematics Research Center
Mathematics Research Center
Türker Bıyıkoğlu — Mathematics Research Center
Türker Bıyıkoğlu
Senior Researcher
Türker Bıyıkoğlu
Graph Theory and its Applications Group
turker.biyikoglu@asoiu.edu.az tbiyikoglu@agmail.com ORCID Google Scholar
Research Interests

My research interests include graph theory, graph modelling, and graph applications.

Awards
  • 2015 Masatoshi Gündüz İkeda Research Award, Türk Matematik Vakfı (Turkish Mathematical Foundation)
  • 2009 Distinguished Young Scholar Award (TUBA-GEBIP/2009), Turkish Academy of Sciences
Research Projects with Funding
  • 2011 – 2014 “Geometric representations and symmetries of graphs, maps and other discrete structures and applications in science” (GReGAS)
    Supported by TÜBİTAK and the European Science Foundation (EUROCORES Programme EUROGIGA) — Principal Researcher
    Supported: Lale Özkahya (post-doc)
  • 2012 – 2014 “Castelnuovo-Mumford Regularity of Graphs and Topology of Decycling Complexes”
    Supported by TÜBİTAK — Joint project with Yusuf Civan (Süleyman Demirel University, Isparta, Turkey)
  • 2012 – 2014 “Bionetalign: Global Alignment of Biochemical Networks Regularity for Functional Orthology”
    Supported by TÜBİTAK — Joint project with Cesim Erten (Kadir Has University, Istanbul, Turkey)
Book
  • ●
    Laplacian Eigenvectors of Graphs
    T. Bıyıkoğlu, J. Leydold and P. F. Stadler
    Lecture Notes in Mathematics 1915, Springer (2007)
    Publisher
Journal Publications
  • ●
    Graph entropy, degree assortativity, and hierarchical structures in networks
    Fatihcan M. Atay, Türker Bıyıkoğlu
    Phys. Rev. E 112, 064315 (2025)
    Publisher
  • ●
    Structure of conflict graphs in constraint alignment problems and algorithms
    F. Alkan, T. Bıyıkoğlu, M. Demange and C. Erten
    Discrete Mathematics & Theoretical Computer Science, 21 no.4 (2019)
    Publisher
  • ●
    Prime Graphs, Matching and the Castelnuovo-Mumford Regularity
    T. Bıyıkoğlu and Y. Civan
    Journal of Commutative Algebra, 11: 1–27 (2019)
    Publisher
  • ●
    Castelnuovo-Mumford Regularity of Graphs
    T. Bıyıkoğlu and Y. Civan
    Combinatorica, 38: 1353–1383 (2018)
    Publisher
  • ●
    Vertex Decomposable Graphs, Codismantlability, Cohen-Macaulayness and Castelnuovo-Mumford Regularity
    T. Bıyıkoğlu and Y. Civan
    Electronic Journal of Combinatorics, 21: #P1.1 (2014)
    Publisher
  • ●
    CAMPways: constrained alignment framework for the comparative analysis of a pair of metabolic pathways
    G. Abaka, T. Bıyıkoğlu, C. Erten
    Bioinformatics, 29: 145–153 (2013)
    Publisher
  • ●
    Four-cycled graphs with topological applications
    T. Bıyıkoğlu and Y. Civan
    Annals of Combinatorics, 16: 37–56 (2012)
    Publisher
  • ●
    Dendrimers are the unique chemical trees with maximum spectral radius
    T. Bıyıkoğlu and J. Leydold
    MATCH Communications in Mathematical and in Computer Chemistry, 68: 851–854 (2012)
    Publisher
  • ●
    Graphs of given order and size and minimum algebraic connectivity
    T. Bıyıkoğlu and J. Leydold
    Linear Algebra and its Applications, 436: 2067–2077 (2012)
    Publisher
  • ●
    Some Notes on Spectra of Cographs
    T. Bıyıkoğlu, S. Simić, Z. Stanić
    Ars Combinatoria, 100: 421–434 (2011)
    Publisher
  • ●
    Cryptanalysis of Fridrich’s image encryption
    E. Solak, C. Cokal, O. T. Yildiz, T. Bıyıkoğlu
    International Journal of Bifurcation and Chaos, 20: 1405–1413 (2010)
    Publisher
  • ●
    Semiregular trees with minimal Laplacian spectral radius
    T. Bıyıkoğlu and J. Leydold
    Linear Algebra and its Applications, 432: 2335–2341 (2010)
    Publisher
  • ●
    Discovering Cis-Regulatory Modules by optimizing Barbecues
    A. Mosig, T. Bıyıkoğlu, S. J. Prohaska, and P. F. Stadler
    Discrete Applied Mathematics, 157: 2458–2468 (2009)
    Publisher
  • ●
    Largest Eigenvalues of the Discrete \(p\)-Laplacian of Trees with Degree Sequences
    T. Bıyıkoğlu, M. Hellmuth, and J. Leydold
    Electronic Journal of Linear Algebra, 18: 202–210 (2009)
    Publisher
  • ●
    Algebraic Connectivity and Degree Sequences of Trees
    T. Bıyıkoğlu and J. Leydold
    Linear Algebra and its Applications, 430: 811–817 (2009)
    Publisher
  • ●
    Graphs with given degree sequence and maximal spectral radius
    T. Bıyıkoğlu and J. Leydold
    Electronic Journal of Combinatorics, 15: R119 (2008)
    Publisher
  • ●
    Faber-Krahn Type Inequalities for Trees
    T. Bıyıkoğlu and J. Leydold
    Journal of Combinatorial Theory, Series B, 97: 159–174 (2007)
    Publisher
  • ●
    Network synchronization: Spectral versus statistical properties
    F. M. Atay, T. Bıyıkoğlu, J. Jost
    Physica D, 224: 35–41 (2006)
    Publisher
  • ●
    Synchronization of Networks with Prescribed Degree Distributions
    F. M. Atay, T. Bıyıkoğlu, J. Jost
    IEEE Transactions on Circuits and Systems I, 53: 92–98 (2006)
    Publisher
  • ●
    Synchronization of Complex Networks under Graph Operations
    F. M. Atay, T. Bıyıkoğlu
    Physical Review E, 72: 016217 (2005)
    Publisher
  • ●
    Nodal Domains and Bipartite Subgraphs
    T. Bıyıkoğlu, J. Leydold, and P. F. Stadler
    Electronic Journal of Linear Algebra, 13: 344–351 (2005)
    Publisher
  • ●
    Degree sequences of Halin graphs and forcibly cograph graphic sequences
    T. Bıyıkoğlu
    Ars Combinatoria, 75: 205–210 (2005)
    Publisher
  • ●
    Graph Laplacians, Nodal Domain, and Hyperplane Arrangements
    T. Bıyıkoğlu, W. Hordijk, J. Leydold, T. Pisanski, P. F. Stadler
    Linear Algebra and its Applications, 390: 155–174 (2004)
    Publisher
  • ●
    A Discrete Nodal Domain Theorem for Trees
    T. Bıyıkoğlu
    Linear Algebra and its Applications, 360: 197–205 (2003)
    Publisher
  • ●
    A counterexample to a conjecture of Erdős
    T. Bıyıkoğlu
    Discrete Mathematics, 250: 231–232 (2002)
    Publisher
Conference Proceedings
  • ●
    Enabling Cooperation, Resource Allocation and Receiver Selection Across Cells: Complementary Fractional Frequency Reuse
    S. Baksi, O. Kaya and T. Bıyıkoğlu
    IEEE PIMRC 2013, London, UK, Sept. 2013
    Publisher
  • ●
    Optimal and Near-optimal Partner Selection Algorithms in Cooperative OFDMA
    S. Baksi, O. Kaya, T. Bıyıkoğlu
    IEEE WCNC 2012, Paris, France, April 2012
    Publisher
Preprints
  • ●
    Bounding the collapsibility number of simplicial complexes and graphs
    T. Bıyıkoğlu and Y. Civan
    Preprint (2023)
    Arxiv
  • ●
    Projective dimension of (hyper)graphs and the Castelnuovo-Mumford regularity of bipartite graphs
    T. Bıyıkoğlu and Y. Civan
    Preprint (2016)
    Arxiv
  • ●
    A note on the recognition of codismantlable graphs and posets
    T. Bıyıkoğlu and Y. Civan
    Preprint (2016)
    PDF
  • ●
    Bounding Castelnuovo-Mumford regularity of graphs via Lozin’s transformation
    T. Bıyıkoğlu and Y. Civan
    Preprint (2013)
    Arxiv
  • ●
    Semiregular Trees with Minimal Index
    T. Bıyıkoğlu and J. Leydold
    Preprint (2009)
    Arxiv
  • ●
    Largest Laplacian Eigenvalue and Degree Sequences of Trees
    T. Bıyıkoğlu, M. Hellmuth, J. Leydold
    Preprint (2007)
    Arxiv
  • ●
    Rank and number of nodal domains of cographs
    T. Bıyıkoğlu
    Preprint (2002)
    PDF
Industrial Research

Founding partner of a consulting company between 2015 and 2017. Developed research-driven steam flow forecasting models and products specially for the Turkish hydroelectric power plant sector.

Seminar & Workshop Organisation
  • 2009 – 2012 Monthly Istanbul Discrete Mathematics Meetings
    Istanbul Center for Mathematical Sciences, Boğaziçi University (with T. Ekim)
  • 2010, 2011, 2012 Workshop on Graph Theory and its Applications I, II, III
    Istanbul (with T. Ekim)
Editorial Service
  • 2017 – 2020 Guest Editor, Matematik Dünyası — Turkish popular mathematics journal