T\u00fcrker B\u0131y\u0131ko\u011flu \u2014 Mathematics Research Center<\/title>\n<link rel=\"preconnect\" href=\"https:\/\/fonts.googleapis.com\">\n<link href=\"https:\/\/fonts.googleapis.com\/css2?family=EB+Garamond:ital,wght@0,400;0,500;0,600;1,400;1,500&family=DM+Mono:wght@300;400;500&family=Outfit:wght@300;400;500;600&display=swap\" rel=\"stylesheet\">\n<script>MathJax = { tex: { inlineMath: [['\\\\(','\\\\)']] } };<\/script>\n<script src=\"https:\/\/cdn.jsdelivr.net\/npm\/mathjax@3\/es5\/tex-chtml.js\" async><\/script>\n<style>\n body { background: #eee; padding: 2rem; margin: 0; }\n \n :root {\n --cream: #F5F0E8;\n --ink: #1A1610;\n --rust: #B84A2F;\n --gold: #C99A2E;\n --slate: #3D4A5C;\n --mist: #E8EDF4;\n --rule: #C8BFA8;\n --garamond: 'EB Garamond', Georgia, serif;\n --mono: 'DM Mono', monospace;\n --sans: 'Outfit', sans-serif;\n }\n *, *::before, *::after { box-sizing: border-box; margin: 0; padding: 0; }\n\n .pp-block {\n max-width: 980px; margin: 0 auto;\n background: var(--cream);\n border: 1px solid var(--rule);\n box-shadow: 4px 4px 0 var(--rule), 8px 8px 0 #d8cdb8;\n overflow: hidden;\n }\n\n \/* \u2500\u2500 Hero \u2500\u2500 *\/\n .pp-hero {\n background: var(--slate); color: var(--cream);\n display: grid; grid-template-columns: 220px 1fr;\n }\n .pp-hero-photo {\n width: 220px; height: 220px;\n object-fit: cover; object-position: center top; display: block;\n }\n .pp-hero-photo-placeholder {\n width: 220px; height: 220px;\n background: linear-gradient(135deg, #4a5a6e, #2e3a4a);\n display: flex; align-items: center; justify-content: center;\n font-family: var(--garamond); font-size: 3rem;\n color: rgba(255,255,255,0.3); font-style: italic;\n }\n .pp-hero-info {\n padding: 2.2rem 2.5rem;\n display: flex; flex-direction: column; justify-content: center;\n gap: 0.5rem; position: relative; overflow: hidden;\n }\n .pp-hero-info::before {\n content: 'T.B.';\n position: absolute; right: -10px; bottom: -15px;\n font-family: var(--garamond); font-size: 7rem; font-weight: 500;\n color: rgba(255,255,255,0.04); pointer-events: none; line-height: 1;\n }\n .pp-hero-tag {\n font-family: var(--mono); font-size: 0.62rem; letter-spacing: 0.16em;\n text-transform: uppercase; color: var(--gold);\n display: flex; align-items: center; gap: 0.5rem;\n }\n .pp-hero-tag::before { content: ''; display: inline-block; width: 16px; height: 1px; background: var(--gold); }\n .pp-hero-name {\n font-family: var(--garamond); font-size: 2.2rem; font-weight: 500;\n line-height: 1.1; letter-spacing: -0.01em;\n }\n .pp-hero-role {\n font-family: var(--garamond); font-style: italic;\n font-size: 1rem; color: rgba(245,240,232,0.65);\n }\n .pp-hero-meta {\n display: flex; flex-wrap: wrap; gap: 0.5rem; margin-top: 0.5rem;\n }\n .pp-hero-link {\n font-family: var(--mono); font-size: 0.62rem; letter-spacing: 0.06em;\n color: var(--gold); text-decoration: none;\n border: 1px solid rgba(201,154,46,0.4); padding: 0.2rem 0.6rem;\n transition: all 0.2s;\n }\n .pp-hero-link:hover { background: var(--gold); color: var(--ink); }\n\n \/* \u2500\u2500 Tabs \u2500\u2500 *\/\n .pp-nav {\n display: flex; border-bottom: 1px solid var(--rule);\n background: #EDE8DE; overflow-x: auto; scrollbar-width: none;\n }\n .pp-nav::-webkit-scrollbar { display: none; }\n .pp-tab {\n padding: 0.85rem 1.3rem; font-family: var(--sans); font-size: 0.75rem;\n font-weight: 500; letter-spacing: 0.06em; text-transform: uppercase;\n cursor: pointer; border: none; background: none; color: #7A6E60;\n white-space: nowrap; border-bottom: 2px solid transparent; margin-bottom: -1px;\n transition: color 0.2s, border-color 0.2s;\n }\n .pp-tab:hover { color: var(--ink); }\n .pp-tab.active { color: var(--rust); border-bottom-color: var(--rust); }\n\n \/* \u2500\u2500 Panels \u2500\u2500 *\/\n .pp-panels { padding: 2.5rem 3rem; }\n .pp-panel { display: none; }\n .pp-panel.active { display: block; }\n\n \/* \u2500\u2500 Section label \u2500\u2500 *\/\n .pp-section-label {\n font-family: var(--mono); font-size: 0.68rem; letter-spacing: 0.18em;\n text-transform: uppercase; color: var(--rust);\n display: flex; align-items: center; gap: 0.7rem; margin-bottom: 1.2rem;\n }\n .pp-section-label::after { content: ''; flex: 1; height: 1px; background: var(--rule); }\n .pp-mt { margin-top: 2rem; }\n\n \/* \u2500\u2500 Research interests \u2500\u2500 *\/\n .pp-research-intro {\n font-family: var(--garamond); font-size: 1.02rem; line-height: 1.8;\n color: #2E2820; margin-bottom: 1.5rem;\n }\n .pp-interests { display: flex; flex-wrap: wrap; gap: 0.5rem; margin-bottom: 2rem; }\n .pp-interest-tag {\n font-family: var(--sans); font-size: 0.75rem; font-weight: 400;\n background: var(--mist); color: var(--slate);\n padding: 0.3rem 0.8rem; border: 1px solid #d0d8e8;\n }\n\n \/* \u2500\u2500 Timeline \u2500\u2500 *\/\n .pp-timeline { list-style: none; padding: 0; }\n .pp-timeline li {\n display: grid; grid-template-columns: 160px 1fr;\n gap: 0 1.2rem; padding: 0.65rem 0;\n border-bottom: 1px solid #EAE3D4;\n font-size: 0.97rem; line-height: 1.6;\n }\n .pp-timeline li:last-child { border-bottom: none; }\n .pp-timeline .tl-year {\n font-family: var(--mono); font-size: 0.68rem; color: #9A8E80;\n letter-spacing: 0.04em; padding-top: 0.18rem; line-height: 1.5;\n }\n .pp-timeline .tl-body { color: #2E2820; }\n .pp-timeline .tl-body strong { font-weight: 500; }\n .pp-timeline .tl-body em { font-style: italic; color: #6A6058; }\n\n \/* \u00e2\u201d\u20ac\u00e2\u201d\u20ac Publications \u00e2\u201d\u20ac\u00e2\u201d\u20ac *\/\n.pp-pub-group { margin-bottom: 2.5rem; }\n.pp-pub-group:last-child { margin-bottom: 0; }\n.pp-pub-list { list-style: none; padding: 0; counter-reset: pub-counter; }\n.pp-pub-item {\n display: grid; grid-template-columns: 28px 1fr;\n gap: 0 0.6rem; padding: 0.7rem 0;\n border-bottom: 1px solid #EAE3D4;\n}\n.pp-pub-item:last-child { border-bottom: none; }\n.pp-pub-num {\n font-family: var(--mono); font-size: 0.65rem; color: var(--rule);\n text-align: right; padding-top: 0.2rem;\n}\n.pp-pub-content {\n display: flex;\n flex-direction: column;\n}\n\n.pub-link.publisher {\n color: #3D4A5C;\n}\n.pub-link.publisher:hover {\n background: #3D4A5C;\n color: #fff;\n}\n.pp-pub-title {\n font-family: var(--garamond); font-size: 1rem; font-weight: 500;\n line-height: 1.4; margin-bottom: 0.15rem;\n}\n.pp-pub-authors {\n font-family: var(--garamond); font-size: 0.9rem; color: #4A4038;\n margin-bottom: 0.15rem;\n}\n.pp-pub-venue {\n font-family: var(--garamond); font-style: italic;\n font-size: 0.88rem; color: #6A6058;\n}\n.pub-links { \n display: flex; flex-wrap: wrap; gap: 0.4rem; \n margin-top: 0.4rem; \/* Added margin to push it off the text slightly *\/\n}\n.pub-link {\n font-family: var(--mono); font-size: 0.62rem; letter-spacing: 0.08em;\n text-transform: uppercase; text-decoration: none;\n padding: 0.18rem 0.55rem;\n border: 1px solid currentColor;\n transition: all 0.15s;\n}\n.pub-link.arxiv { color: #B84A2F; }\n.pub-link.doi { color: #3D4A5C; }\n.pub-link.arxiv:hover { background: #B84A2F; color: #fff; }\n.pub-link.doi:hover { background: #3D4A5C; color: #fff; }\n\n\n \/* \u2500\u2500 Service \u2500\u2500 *\/\n .pp-prose {\n font-family: var(--garamond); font-size: 1rem; line-height: 1.8;\n color: #2E2820;\n }\n .pp-prose p + p { margin-top: 0.8em; }\n\n \/* \u2500\u2500 MOBILE FIXES \u2500\u2500 *\/\n @media (max-width: 680px) { .pp-hero { grid-template-columns: 1fr; }\n .pp-hero-photo, .pp-hero-photo-placeholder { \n width: 100%; \n height: auto; \n aspect-ratio: 1 \/ 1; \/* Scales naturally without squashing *\/\n }\n .pp-hero-info { padding: 1.5rem; }\n .pp-hero-info::before { font-size: 5rem; bottom: -5px; } \/* Prevent overlap *\/\n .pp-panels { padding: 1.5rem 1.2rem; }\n .pp-timeline li { grid-template-columns: 1fr; gap: 0.2rem; padding: 1rem 0; }\n .pp-pub-item { grid-template-columns: 25px 1fr; }\n }\n ::-webkit-scrollbar { width: 5px; } ::-webkit-scrollbar-track { background: transparent; } ::-webkit-scrollbar-thumb { background: var(--rule); }\n<\/style>\n<\/head>\n<body>\n\n<div class=\"pp-block\">\n\n <div class=\"pp-hero\">\n <img decoding=\"async\" class=\"pp-hero-photo\" src=\"http:\/\/mrc-baku.org\/wp\/wp-content\/uploads\/2026\/03\/TurkerBiyikoglu-1024x1016.jpeg\" alt=\"T\u00fcrker B\u0131y\u0131ko\u011flu\">\n <div class=\"pp-hero-info\">\n <div class=\"pp-hero-tag\">Senior Researcher<\/div>\n <div class=\"pp-hero-name\">T\u00fcrker B\u0131y\u0131ko\u011flu<\/div>\n <div class=\"pp-hero-role\">Graph Theory and its Applications Group<\/div>\n <div class=\"pp-hero-meta\"> \n <a class=\"pp-hero-link\" href=\"mailto:turker.biyikoglu@asoiu.edu.az\">turker.biyikoglu@asoiu.edu.az<\/a>\n <a class=\"pp-hero-link\" href=\"mailto:tbiyikoglu@agmail.com\">tbiyikoglu@agmail.com<\/a>\n <a class=\"pp-hero-link\" href=\"https:\/\/orcid.org\/0009-0009-4499-1938\">ORCID<\/a>\n <a class=\"pp-hero-link\" href=\"https:\/\/scholar.google.com\/citations?user=jpUHb10AAAAJ&hl=en\">Google Scholar<\/a>\n <\/div>\n <\/div>\n <\/div>\n\n <nav class=\"pp-nav\" role=\"tablist\">\n <button class=\"pp-tab active\" data-panel=\"research\">Research<\/button>\n <button class=\"pp-tab\" data-panel=\"awards\">Awards & Projects<\/button>\n <button class=\"pp-tab\" data-panel=\"publications\">Publications<\/button>\n <button class=\"pp-tab\" data-panel=\"service\">Service<\/button>\n <\/nav>\n\n <div class=\"pp-panels\">\n\n <section class=\"pp-panel active\" id=\"panel-research\">\n <div class=\"pp-section-label\">Research Interests<\/div>\n <p class=\"pp-research-intro\">My research interests include graph theory, graph modelling, and graph applications. <\/p>\n <\/section>\n\n <section class=\"pp-panel\" id=\"panel-awards\">\n <div class=\"pp-section-label\">Awards<\/div>\n <ul class=\"pp-timeline\">\n <li>\n <span class=\"tl-year\">2015<\/span>\n <span class=\"tl-body\"><strong>Masatoshi G\u00fcnd\u00fcz \u0130keda Research Award<\/strong>, <em>T\u00fcrk Matematik Vakf\u0131 (Turkish Mathematical Foundation)<\/em><\/span>\n <\/li>\n <li>\n <span class=\"tl-year\">2009<\/span>\n <span class=\"tl-body\"><strong>Distinguished Young Scholar Award<\/strong> (TUBA-GEBIP\/2009), <em>Turkish Academy of Sciences<\/em><\/span>\n <\/li>\n <\/ul>\n\n <div class=\"pp-section-label pp-mt\">Research Projects with Funding<\/div>\n <ul class=\"pp-timeline\">\n <li>\n <span class=\"tl-year\">2011 \u2013 2014<\/span>\n <span class=\"tl-body\">\n <strong>“Geometric representations and symmetries of graphs, maps and other discrete structures and applications in science” (GReGAS)<\/strong><br>\n Supported by T\u00dcB\u0130TAK and the European Science Foundation (EUROCORES Programme EUROGIGA) \u2014 Principal Researcher<br>\n <em>Supported: Lale \u00d6zkahya (post-doc)<\/em>\n <\/span>\n <\/li>\n <li>\n <span class=\"tl-year\">2012 \u2013 2014<\/span>\n <span class=\"tl-body\">\n <strong>“Castelnuovo-Mumford Regularity of Graphs and Topology of Decycling Complexes”<\/strong><br>\n Supported by T\u00dcB\u0130TAK \u2014 Joint project with Yusuf Civan (S\u00fcleyman Demirel University, Isparta, Turkey)\n <\/span>\n <\/li>\n <li>\n <span class=\"tl-year\">2012 \u2013 2014<\/span>\n <span class=\"tl-body\">\n <strong>“Bionetalign: Global Alignment of Biochemical Networks Regularity for Functional Orthology”<\/strong><br>\n Supported by T\u00dcB\u0130TAK \u2014 Joint project with Cesim Erten (Kadir Has University, Istanbul, Turkey)\n <\/span>\n <\/li>\n <\/ul>\n <\/section>\n\n <section class=\"pp-panel\" id=\"panel-publications\">\n\n <div class=\"pp-pub-group\">\n <div class=\"pp-section-label\">Book<\/div>\n <ul class=\"pp-pub-list\">\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Laplacian Eigenvectors of Graphs<\/div>\n <div class=\"pp-pub-authors\">T. B\u0131y\u0131ko\u011flu, J. Leydold and P. F. Stadler<\/div>\n <div class=\"pp-pub-venue\">Lecture Notes in Mathematics 1915, Springer (2007)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"https:\/\/link.springer.com\/book\/10.1007\/978-3-540-73510-6\n\" target=\"_blank\" rel=\"noopener\">Publisher<\/a><\/div>\n \n <\/div>\n <\/li>\n <\/ul>\n <\/div>\n\n <div class=\"pp-pub-group\">\n <div class=\"pp-section-label\">Journal Publications<\/div>\n <ul class=\"pp-pub-list\">\n <li class=\"pp-pub-item\">\n<span class=\"pp-pub-num\">●<\/span>\n<div>\n <div class=\"pp-pub-title\">Graph entropy, degree assortativity, and hierarchical structures in networks<\/div>\n <div class=\"pp-pub-authors\">Fatihcan M. Atay, T\u00fcrker B\u0131y\u0131ko\u011flu<\/div>\n <div class=\"pp-pub-venue\">Phys. Rev. E 112, 064315 (2025)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"<a href=\"https:\/\/doi.org\/10.1103\/6kxf-qn44\"_blank\" rel=\"noopener\">Publisher<\/a> <\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n<span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Structure of conflict graphs in constraint alignment problems and algorithms<\/div>\n <div class=\"pp-pub-authors\">F. Alkan, T. B\u0131y\u0131ko\u011flu, M. Demange and C. Erten<\/div>\n <div class=\"pp-pub-venue\">Discrete Mathematics & Theoretical Computer Science, 21 no.4 (2019)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"https:\/\/dmtcs.episciences.org\/5755\n\"_blank\" rel=\"noopener\">Publisher<\/a> <\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Prime Graphs, Matching and the Castelnuovo-Mumford Regularity<\/div>\n <div class=\"pp-pub-authors\">T. B\u0131y\u0131ko\u011flu and Y. Civan<\/div>\n <div class=\"pp-pub-venue\">Journal of Commutative Algebra, 11: 1\u201327 (2019)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"https:\/\/projecteuclid.org\/journals\/journal-of-commutative-algebra\/volume-11\/issue-1\/Prime-graphs-matchings-and-the-Castelnuovo-Mumford-regularity\/10.1216\/JCA-2019-11-1-1.full\n\"_blank\" rel=\"noopener\">Publisher<\/a><\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Castelnuovo-Mumford Regularity of Graphs<\/div>\n <div class=\"pp-pub-authors\">T. B\u0131y\u0131ko\u011flu and Y. Civan<\/div>\n <div class=\"pp-pub-venue\">Combinatorica, 38: 1353\u20131383 (2018)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"https:\/\/link.springer.com\/article\/10.1007\/s00493-017-3450-1\"_blank\" rel=\"noopener\">Publisher<\/a><\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Vertex Decomposable Graphs, Codismantlability, Cohen-Macaulayness and Castelnuovo-Mumford Regularity<\/div>\n <div class=\"pp-pub-authors\">T. B\u0131y\u0131ko\u011flu and Y. Civan<\/div>\n <div class=\"pp-pub-venue\">Electronic Journal of Combinatorics, 21: #P1.1 (2014)<\/div>\n\t\t<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v21i1p1\n\"_blank\" rel=\"noopener\">Publisher<\/a><\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">CAMPways: constrained alignment framework for the comparative analysis of a pair of metabolic pathways<\/div>\n <div class=\"pp-pub-authors\">G. Abaka, T. B\u0131y\u0131ko\u011flu, C. Erten<\/div>\n <div class=\"pp-pub-venue\">Bioinformatics, 29: 145\u2013153 (2013)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"https:\/\/academic.oup.com\/bioinformatics\/article\/29\/13\/i145\/197346\n\"_blank\" rel=\"noopener\">Publisher<\/a><\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Four-cycled graphs with topological applications<\/div>\n <div class=\"pp-pub-authors\">T. B\u0131y\u0131ko\u011flu and Y. Civan<\/div>\n <div class=\"pp-pub-venue\">Annals of Combinatorics, 16: 37\u201356 (2012)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"https:\/\/link.springer.com\/article\/10.1007\/s00026-011-0120-7\n\"_blank\" rel=\"noopener\">Publisher<\/a><\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Dendrimers are the unique chemical trees with maximum spectral radius<\/div>\n <div class=\"pp-pub-authors\">T. B\u0131y\u0131ko\u011flu and J. Leydold<\/div>\n <div class=\"pp-pub-venue\">MATCH Communications in Mathematical and in Computer Chemistry, 68: 851\u2013854 (2012)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"https:\/\/match.pmf.kg.ac.rs\/electronic_versions\/Match68\/n3\/match68n3_851-854.pdf\n\"_blank\" rel=\"noopener\">Publisher<\/a><\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Graphs of given order and size and minimum algebraic connectivity<\/div>\n <div class=\"pp-pub-authors\">T. B\u0131y\u0131ko\u011flu and J. Leydold<\/div>\n <div class=\"pp-pub-venue\">Linear Algebra and its Applications, 436: 2067\u20132077 (2012)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0024379511006628\n\"_blank\" rel=\"noopener\">Publisher<\/a><\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Some Notes on Spectra of Cographs<\/div>\n <div class=\"pp-pub-authors\">T. B\u0131y\u0131ko\u011flu, S. Simi\u0107, Z. Stani\u0107<\/div>\n <div class=\"pp-pub-venue\">Ars Combinatoria, 100: 421\u2013434 (2011)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"https:\/\/combinatorialpress.com\/ars-articles\/volume-100-ars-articles\/some-notes-on-spectra-of-cographs\/\n\"_blank\" rel=\"noopener\">Publisher<\/a><\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Cryptanalysis of Fridrich’s image encryption<\/div>\n <div class=\"pp-pub-authors\">E. Solak, C. Cokal, O. T. Yildiz, T. B\u0131y\u0131ko\u011flu<\/div>\n <div class=\"pp-pub-venue\">International Journal of Bifurcation and Chaos, 20: 1405\u20131413 (2010)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0218127410026563\n\"_blank\" rel=\"noopener\">Publisher<\/a><\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Semiregular trees with minimal Laplacian spectral radius<\/div>\n <div class=\"pp-pub-authors\">T. B\u0131y\u0131ko\u011flu and J. Leydold<\/div>\n <div class=\"pp-pub-venue\">Linear Algebra and its Applications, 432: 2335\u20132341 (2010)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0024379509003085\n\"_blank\" rel=\"noopener\">Publisher<\/a><\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Discovering Cis-Regulatory Modules by optimizing Barbecues<\/div>\n <div class=\"pp-pub-authors\">A. Mosig, T. B\u0131y\u0131ko\u011flu, S. J. Prohaska, and P. F. Stadler<\/div>\n <div class=\"pp-pub-venue\">Discrete Applied Mathematics, 157: 2458\u20132468 (2009)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0166218X08003570\n\"_blank\" rel=\"noopener\">Publisher<\/a><\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Largest Eigenvalues of the Discrete \\(p\\)-Laplacian of Trees with Degree Sequences<\/div>\n <div class=\"pp-pub-authors\">T. B\u0131y\u0131ko\u011flu, M. Hellmuth, and J. Leydold<\/div>\n <div class=\"pp-pub-venue\">Electronic Journal of Linear Algebra, 18: 202\u2013210 (2009)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"https:\/\/journals.uwyo.edu\/index.php\/ela\/article\/view\/611\"_blank\" rel=\"noopener\">Publisher<\/a><\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Algebraic Connectivity and Degree Sequences of Trees<\/div>\n <div class=\"pp-pub-authors\">T. B\u0131y\u0131ko\u011flu and J. Leydold<\/div>\n <div class=\"pp-pub-venue\">Linear Algebra and its Applications, 430: 811\u2013817 (2009)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0024379508004680\n\"_blank\" rel=\"noopener\">Publisher<\/a><\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Graphs with given degree sequence and maximal spectral radius<\/div>\n <div class=\"pp-pub-authors\">T. B\u0131y\u0131ko\u011flu and J. Leydold<\/div>\n <div class=\"pp-pub-venue\">Electronic Journal of Combinatorics, 15: R119 (2008)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v15i1r119\n\"_blank\" rel=\"noopener\">Publisher<\/a><\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Faber-Krahn Type Inequalities for Trees<\/div>\n <div class=\"pp-pub-authors\">T. B\u0131y\u0131ko\u011flu and J. Leydold<\/div>\n <div class=\"pp-pub-venue\">Journal of Combinatorial Theory, Series B, 97: 159\u2013174 (2007)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0095895606000499\n\"_blank\" rel=\"noopener\">Publisher<\/a><\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Network synchronization: Spectral versus statistical properties<\/div>\n <div class=\"pp-pub-authors\">F. M. Atay, T. B\u0131y\u0131ko\u011flu, J. Jost<\/div>\n <div class=\"pp-pub-venue\">Physica D, 224: 35\u201341 (2006)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"https:\/\/www.sciencedirect.com\/science\/article\/abs\/pii\/S0167278906003794\n\"_blank\" rel=\"noopener\">Publisher<\/a><\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Synchronization of Networks with Prescribed Degree Distributions<\/div>\n <div class=\"pp-pub-authors\">F. M. Atay, T. B\u0131y\u0131ko\u011flu, J. Jost<\/div>\n <div class=\"pp-pub-venue\">IEEE Transactions on Circuits and Systems I, 53: 92\u201398 (2006)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"https:\/\/ieeexplore.ieee.org\/document\/1576889\n\"_blank\" rel=\"noopener\">Publisher<\/a><\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Synchronization of Complex Networks under Graph Operations<\/div>\n <div class=\"pp-pub-authors\">F. M. Atay, T. B\u0131y\u0131ko\u011flu<\/div>\n <div class=\"pp-pub-venue\">Physical Review E, 72: 016217 (2005)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"https:\/\/journals.aps.org\/pre\/abstract\/10.1103\/PhysRevE.72.016217\n\"_blank\" rel=\"noopener\">Publisher<\/a><\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Nodal Domains and Bipartite Subgraphs<\/div>\n <div class=\"pp-pub-authors\">T. B\u0131y\u0131ko\u011flu, J. Leydold, and P. F. Stadler<\/div>\n <div class=\"pp-pub-venue\">Electronic Journal of Linear Algebra, 13: 344\u2013351 (2005)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"https:\/\/journals.uwyo.edu\/index.php\/ela\/article\/view\/335\n\"_blank\" rel=\"noopener\">Publisher<\/a><\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Degree sequences of Halin graphs and forcibly cograph graphic sequences<\/div>\n <div class=\"pp-pub-authors\">T. B\u0131y\u0131ko\u011flu<\/div>\n <div class=\"pp-pub-venue\">Ars Combinatoria, 75: 205\u2013210 (2005)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"https:\/\/combinatorialpress.com\/ars-articles\/volume-075-ars-articles\/degree-sequences-of-halin-graphs-and-forcibly-cograph-graphic-sequences\/\n\"_blank\" rel=\"noopener\">Publisher<\/a><\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Graph Laplacians, Nodal Domain, and Hyperplane Arrangements<\/div>\n <div class=\"pp-pub-authors\">T. B\u0131y\u0131ko\u011flu, W. Hordijk, J. Leydold, T. Pisanski, P. F. Stadler<\/div>\n <div class=\"pp-pub-venue\">Linear Algebra and its Applications, 390: 155\u2013174 (2004)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0024379504002113\n\"_blank\" rel=\"noopener\">Publisher<\/a><\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">A Discrete Nodal Domain Theorem for Trees<\/div>\n <div class=\"pp-pub-authors\">T. B\u0131y\u0131ko\u011flu<\/div>\n <div class=\"pp-pub-venue\">Linear Algebra and its Applications, 360: 197\u2013205 (2003)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0024379502004512\n\"_blank\" rel=\"noopener\">Publisher<\/a><\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">A counterexample to a conjecture of Erd\u0151s<\/div>\n <div class=\"pp-pub-authors\">T. B\u0131y\u0131ko\u011flu<\/div>\n <div class=\"pp-pub-venue\">Discrete Mathematics, 250: 231\u2013232 (2002)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0012365X00001588\n\"_blank\" rel=\"noopener\">Publisher<\/a><\/div>\n <\/div>\n <\/li>\n <\/ul>\n <\/div>\n\n <div class=\"pp-pub-group\">\n <div class=\"pp-section-label\">Conference Proceedings<\/div>\n <ul class=\"pp-pub-list\">\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Enabling Cooperation, Resource Allocation and Receiver Selection Across Cells: Complementary Fractional Frequency Reuse<\/div>\n <div class=\"pp-pub-authors\">S. Baksi, O. Kaya and T. B\u0131y\u0131ko\u011flu<\/div>\n <div class=\"pp-pub-venue\">IEEE PIMRC 2013, London, UK, Sept. 2013<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"https:\/\/ieeexplore.ieee.org\/document\/6666319\"_blank\" rel=\"noopener\">Publisher<\/a>\n <\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Optimal and Near-optimal Partner Selection Algorithms in Cooperative OFDMA<\/div>\n <div class=\"pp-pub-authors\">S. Baksi, O. Kaya, T. B\u0131y\u0131ko\u011flu<\/div>\n <div class=\"pp-pub-venue\">IEEE WCNC 2012, Paris, France, April 2012<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"https:\/\/ieeexplore.ieee.org\/document\/6214413\"_blank\" rel=\"noopener\">Publisher<\/a>\n <\/div>\n <\/div>\n <\/li>\n <\/ul>\n <\/div>\n\n <div class=\"pp-pub-group\">\n <div class=\"pp-section-label\">Preprints<\/div>\n <ul class=\"pp-pub-list\">\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Bounding the collapsibility number of simplicial complexes and graphs<\/div>\n <div class=\"pp-pub-authors\">T. B\u0131y\u0131ko\u011flu and Y. Civan<\/div>\n <div class=\"pp-pub-venue\">Preprint (2023)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link arxiv\" href=\"https:\/\/arxiv.org\/abs\/2201.13046\" target=_blank\" rel=\"noopener\">Arxiv<\/a>\n <\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Projective dimension of (hyper)graphs and the Castelnuovo-Mumford regularity of bipartite graphs<\/div>\n <div class=\"pp-pub-authors\">T. B\u0131y\u0131ko\u011flu and Y. Civan<\/div>\n <div class=\"pp-pub-venue\">Preprint (2016)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link arxiv\" href=\"https:\/\/arxiv.org\/abs\/1605.02956\" target=_blank\" rel=\"noopener\">Arxiv<\/a>\n <\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">A note on the recognition of codismantlable graphs and posets<\/div>\n <div class=\"pp-pub-authors\">T. B\u0131y\u0131ko\u011flu and Y. Civan<\/div>\n <div class=\"pp-pub-venue\">Preprint (2016)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"https:\/\/mrc-baku.org\/wp-content\/uploads\/2026\/04\/codis-graphs-posets.pdf\" target=_blank\" rel=\"noopener\">PDF<\/a>\n <\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Bounding Castelnuovo-Mumford regularity of graphs via Lozin’s transformation<\/div>\n <div class=\"pp-pub-authors\">T. B\u0131y\u0131ko\u011flu and Y. Civan<\/div>\n <div class=\"pp-pub-venue\">Preprint (2013)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link arxiv\" href=\"https:\/\/arxiv.org\/abs\/1302.3064\" target=_blank\" rel=\"noopener\">Arxiv<\/a>\n <\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Semiregular Trees with Minimal Index<\/div>\n <div class=\"pp-pub-authors\">T. B\u0131y\u0131ko\u011flu and J. Leydold<\/div>\n <div class=\"pp-pub-venue\">Preprint (2009)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link arxiv\" href=\"https:\/\/arxiv.org\/abs\/0906.1517\" target=_blank\" rel=\"noopener\">Arxiv<\/a>\n <\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Largest Laplacian Eigenvalue and Degree Sequences of Trees<\/div>\n <div class=\"pp-pub-authors\">T. B\u0131y\u0131ko\u011flu, M. Hellmuth, J. Leydold<\/div>\n <div class=\"pp-pub-venue\">Preprint (2007)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link arxiv\" href=\"https:\/\/arxiv.org\/abs\/0804.2776\" target=_blank\" rel=\"noopener\">Arxiv<\/a>\n <\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Rank and number of nodal domains of cographs<\/div>\n <div class=\"pp-pub-authors\">T. B\u0131y\u0131ko\u011flu<\/div>\n <div class=\"pp-pub-venue\">Preprint (2002)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publiseher\" href=\"https:\/\/mrc-baku.org\/wp-content\/uploads\/2026\/04\/rank_cograph.pdf\" target=_blank\" rel=\"noopener\">PDF<\/a>\n <\/div>\n <\/li>\n <\/ul>\n <\/div>\n\n\n <\/section>\n\n <section class=\"pp-panel\" id=\"panel-service\">\n <div class=\"pp-section-label\">Industrial Research<\/div>\n <div class=\"pp-prose\">\n <p>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.<\/p>\n <\/div>\n\n <div class=\"pp-section-label pp-mt\">Seminar & Workshop Organisation<\/div>\n <ul class=\"pp-timeline\">\n <li>\n <span class=\"tl-year\">2009 \u2013 2012<\/span>\n <span class=\"tl-body\">\n <strong>Monthly Istanbul Discrete Mathematics Meetings<\/strong><br>\n <em>Istanbul Center for Mathematical Sciences, Bo\u011fazi\u00e7i University (with T. Ekim)<\/em>\n <\/span>\n <\/li>\n <li>\n <span class=\"tl-year\">2010, 2011, 2012<\/span>\n <span class=\"tl-body\">\n <strong>Workshop on Graph Theory and its Applications I, II, III<\/strong><br>\n <em>Istanbul (with T. Ekim)<\/em>\n <\/span>\n <\/li>\n <\/ul>\n\n <div class=\"pp-section-label pp-mt\">Editorial Service<\/div>\n <ul class=\"pp-timeline\">\n <li>\n <span class=\"tl-year\">2017 \u2013 2020<\/span>\n <span class=\"tl-body\"><strong>Guest Editor<\/strong>, <em>Matematik D\u00fcnyas\u0131<\/em> \u2014 Turkish popular mathematics journal<\/span>\n <\/li>\n <\/ul>\n <\/section>\n\n <\/div><\/div><script>\ndocument.querySelectorAll('.pp-tab').forEach(function(tab) {\n tab.addEventListener('click', function() {\n var panel = tab.dataset.panel;\n document.querySelectorAll('.pp-tab').forEach(function(t) { t.classList.remove('active'); });\n document.querySelectorAll('.pp-panel').forEach(function(p) { p.classList.remove('active'); });\n tab.classList.add('active');\n document.getElementById('panel-' + panel).classList.add('active');\n });\n});\n<\/script>\n\n<\/body>\n<\/html>\n\n\n\n<p><\/p>\n","protected":false},"excerpt":{"rendered":"<p>T\u00fcrker B\u0131y\u0131ko\u011flu \u2014 Mathematics Research Center Senior Researcher T\u00fcrker B\u0131y\u0131ko\u011flu Graph Theory and its Applications Group turker.biyikoglu@asoiu.edu.az tbiyikoglu@agmail.com ORCID Google Scholar Research Awards & Projects Publications Service Research Interests My research interests include graph theory, graph modelling, and graph applications. Awards 2015 Masatoshi G\u00fcnd\u00fcz \u0130keda Research Award, T\u00fcrk Matematik Vakf\u0131 (Turkish Mathematical Foundation) 2009 Distinguished […]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-130","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/mrc-baku.org\/index.php\/wp-json\/wp\/v2\/pages\/130","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/mrc-baku.org\/index.php\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/mrc-baku.org\/index.php\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/mrc-baku.org\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/mrc-baku.org\/index.php\/wp-json\/wp\/v2\/comments?post=130"}],"version-history":[{"count":23,"href":"https:\/\/mrc-baku.org\/index.php\/wp-json\/wp\/v2\/pages\/130\/revisions"}],"predecessor-version":[{"id":665,"href":"https:\/\/mrc-baku.org\/index.php\/wp-json\/wp\/v2\/pages\/130\/revisions\/665"}],"wp:attachment":[{"href":"https:\/\/mrc-baku.org\/index.php\/wp-json\/wp\/v2\/media?parent=130"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}

{"id":130,"date":"2026-04-15T05:54:03","date_gmt":"2026-04-15T05:54:03","guid":{"rendered":"https:\/\/mrc-baku.org\/?page_id=130"},"modified":"2026-05-09T17:30:09","modified_gmt":"2026-05-09T17:30:09","slug":"turkerbiyikoglu","status":"publish","type":"page","link":"https:\/\/mrc-baku.org\/index.php\/turkerbiyikoglu\/","title":{"rendered":"MRC – T\u00fcrker B\u0131y\u0131ko\u011flu"},"content":{"rendered":"\n\n\n\n\n\nT\u00fcrker B\u0131y\u0131ko\u011flu \u2014 Mathematics Research Center<\/title>\n<link rel=\"preconnect\" href=\"https:\/\/fonts.googleapis.com\">\n<link href=\"https:\/\/fonts.googleapis.com\/css2?family=EB+Garamond:ital,wght@0,400;0,500;0,600;1,400;1,500&family=DM+Mono:wght@300;400;500&family=Outfit:wght@300;400;500;600&display=swap\" rel=\"stylesheet\">\n<script>MathJax = { tex: { inlineMath: [['\\\\(','\\\\)']] } };<\/script>\n<script src=\"https:\/\/cdn.jsdelivr.net\/npm\/mathjax@3\/es5\/tex-chtml.js\" async><\/script>\n<style>\n body { background: #eee; padding: 2rem; margin: 0; }\n \n :root {\n --cream: #F5F0E8;\n --ink: #1A1610;\n --rust: #B84A2F;\n --gold: #C99A2E;\n --slate: #3D4A5C;\n --mist: #E8EDF4;\n --rule: #C8BFA8;\n --garamond: 'EB Garamond', Georgia, serif;\n --mono: 'DM Mono', monospace;\n --sans: 'Outfit', sans-serif;\n }\n *, *::before, *::after { box-sizing: border-box; margin: 0; padding: 0; }\n\n .pp-block {\n max-width: 980px; margin: 0 auto;\n background: var(--cream);\n border: 1px solid var(--rule);\n box-shadow: 4px 4px 0 var(--rule), 8px 8px 0 #d8cdb8;\n overflow: hidden;\n }\n\n \/* \u2500\u2500 Hero \u2500\u2500 *\/\n .pp-hero {\n background: var(--slate); color: var(--cream);\n display: grid; grid-template-columns: 220px 1fr;\n }\n .pp-hero-photo {\n width: 220px; height: 220px;\n object-fit: cover; object-position: center top; display: block;\n }\n .pp-hero-photo-placeholder {\n width: 220px; height: 220px;\n background: linear-gradient(135deg, #4a5a6e, #2e3a4a);\n display: flex; align-items: center; justify-content: center;\n font-family: var(--garamond); font-size: 3rem;\n color: rgba(255,255,255,0.3); font-style: italic;\n }\n .pp-hero-info {\n padding: 2.2rem 2.5rem;\n display: flex; flex-direction: column; justify-content: center;\n gap: 0.5rem; position: relative; overflow: hidden;\n }\n .pp-hero-info::before {\n content: 'T.B.';\n position: absolute; right: -10px; bottom: -15px;\n font-family: var(--garamond); font-size: 7rem; font-weight: 500;\n color: rgba(255,255,255,0.04); pointer-events: none; line-height: 1;\n }\n .pp-hero-tag {\n font-family: var(--mono); font-size: 0.62rem; letter-spacing: 0.16em;\n text-transform: uppercase; color: var(--gold);\n display: flex; align-items: center; gap: 0.5rem;\n }\n .pp-hero-tag::before { content: ''; display: inline-block; width: 16px; height: 1px; background: var(--gold); }\n .pp-hero-name {\n font-family: var(--garamond); font-size: 2.2rem; font-weight: 500;\n line-height: 1.1; letter-spacing: -0.01em;\n }\n .pp-hero-role {\n font-family: var(--garamond); font-style: italic;\n font-size: 1rem; color: rgba(245,240,232,0.65);\n }\n .pp-hero-meta {\n display: flex; flex-wrap: wrap; gap: 0.5rem; margin-top: 0.5rem;\n }\n .pp-hero-link {\n font-family: var(--mono); font-size: 0.62rem; letter-spacing: 0.06em;\n color: var(--gold); text-decoration: none;\n border: 1px solid rgba(201,154,46,0.4); padding: 0.2rem 0.6rem;\n transition: all 0.2s;\n }\n .pp-hero-link:hover { background: var(--gold); color: var(--ink); }\n\n \/* \u2500\u2500 Tabs \u2500\u2500 *\/\n .pp-nav {\n display: flex; border-bottom: 1px solid var(--rule);\n background: #EDE8DE; overflow-x: auto; scrollbar-width: none;\n }\n .pp-nav::-webkit-scrollbar { display: none; }\n .pp-tab {\n padding: 0.85rem 1.3rem; font-family: var(--sans); font-size: 0.75rem;\n font-weight: 500; letter-spacing: 0.06em; text-transform: uppercase;\n cursor: pointer; border: none; background: none; color: #7A6E60;\n white-space: nowrap; border-bottom: 2px solid transparent; margin-bottom: -1px;\n transition: color 0.2s, border-color 0.2s;\n }\n .pp-tab:hover { color: var(--ink); }\n .pp-tab.active { color: var(--rust); border-bottom-color: var(--rust); }\n\n \/* \u2500\u2500 Panels \u2500\u2500 *\/\n .pp-panels { padding: 2.5rem 3rem; }\n .pp-panel { display: none; }\n .pp-panel.active { display: block; }\n\n \/* \u2500\u2500 Section label \u2500\u2500 *\/\n .pp-section-label {\n font-family: var(--mono); font-size: 0.68rem; letter-spacing: 0.18em;\n text-transform: uppercase; color: var(--rust);\n display: flex; align-items: center; gap: 0.7rem; margin-bottom: 1.2rem;\n }\n .pp-section-label::after { content: ''; flex: 1; height: 1px; background: var(--rule); }\n .pp-mt { margin-top: 2rem; }\n\n \/* \u2500\u2500 Research interests \u2500\u2500 *\/\n .pp-research-intro {\n font-family: var(--garamond); font-size: 1.02rem; line-height: 1.8;\n color: #2E2820; margin-bottom: 1.5rem;\n }\n .pp-interests { display: flex; flex-wrap: wrap; gap: 0.5rem; margin-bottom: 2rem; }\n .pp-interest-tag {\n font-family: var(--sans); font-size: 0.75rem; font-weight: 400;\n background: var(--mist); color: var(--slate);\n padding: 0.3rem 0.8rem; border: 1px solid #d0d8e8;\n }\n\n \/* \u2500\u2500 Timeline \u2500\u2500 *\/\n .pp-timeline { list-style: none; padding: 0; }\n .pp-timeline li {\n display: grid; grid-template-columns: 160px 1fr;\n gap: 0 1.2rem; padding: 0.65rem 0;\n border-bottom: 1px solid #EAE3D4;\n font-size: 0.97rem; line-height: 1.6;\n }\n .pp-timeline li:last-child { border-bottom: none; }\n .pp-timeline .tl-year {\n font-family: var(--mono); font-size: 0.68rem; color: #9A8E80;\n letter-spacing: 0.04em; padding-top: 0.18rem; line-height: 1.5;\n }\n .pp-timeline .tl-body { color: #2E2820; }\n .pp-timeline .tl-body strong { font-weight: 500; }\n .pp-timeline .tl-body em { font-style: italic; color: #6A6058; }\n\n \/* \u00e2\u201d\u20ac\u00e2\u201d\u20ac Publications \u00e2\u201d\u20ac\u00e2\u201d\u20ac *\/\n.pp-pub-group { margin-bottom: 2.5rem; }\n.pp-pub-group:last-child { margin-bottom: 0; }\n.pp-pub-list { list-style: none; padding: 0; counter-reset: pub-counter; }\n.pp-pub-item {\n display: grid; grid-template-columns: 28px 1fr;\n gap: 0 0.6rem; padding: 0.7rem 0;\n border-bottom: 1px solid #EAE3D4;\n}\n.pp-pub-item:last-child { border-bottom: none; }\n.pp-pub-num {\n font-family: var(--mono); font-size: 0.65rem; color: var(--rule);\n text-align: right; padding-top: 0.2rem;\n}\n.pp-pub-content {\n display: flex;\n flex-direction: column;\n}\n\n.pub-link.publisher {\n color: #3D4A5C;\n}\n.pub-link.publisher:hover {\n background: #3D4A5C;\n color: #fff;\n}\n.pp-pub-title {\n font-family: var(--garamond); font-size: 1rem; font-weight: 500;\n line-height: 1.4; margin-bottom: 0.15rem;\n}\n.pp-pub-authors {\n font-family: var(--garamond); font-size: 0.9rem; color: #4A4038;\n margin-bottom: 0.15rem;\n}\n.pp-pub-venue {\n font-family: var(--garamond); font-style: italic;\n font-size: 0.88rem; color: #6A6058;\n}\n.pub-links { \n display: flex; flex-wrap: wrap; gap: 0.4rem; \n margin-top: 0.4rem; \/* Added margin to push it off the text slightly *\/\n}\n.pub-link {\n font-family: var(--mono); font-size: 0.62rem; letter-spacing: 0.08em;\n text-transform: uppercase; text-decoration: none;\n padding: 0.18rem 0.55rem;\n border: 1px solid currentColor;\n transition: all 0.15s;\n}\n.pub-link.arxiv { color: #B84A2F; }\n.pub-link.doi { color: #3D4A5C; }\n.pub-link.arxiv:hover { background: #B84A2F; color: #fff; }\n.pub-link.doi:hover { background: #3D4A5C; color: #fff; }\n\n\n \/* \u2500\u2500 Service \u2500\u2500 *\/\n .pp-prose {\n font-family: var(--garamond); font-size: 1rem; line-height: 1.8;\n color: #2E2820;\n }\n .pp-prose p + p { margin-top: 0.8em; }\n\n \/* \u2500\u2500 MOBILE FIXES \u2500\u2500 *\/\n @media (max-width: 680px) { .pp-hero { grid-template-columns: 1fr; }\n .pp-hero-photo, .pp-hero-photo-placeholder { \n width: 100%; \n height: auto; \n aspect-ratio: 1 \/ 1; \/* Scales naturally without squashing *\/\n }\n .pp-hero-info { padding: 1.5rem; }\n .pp-hero-info::before { font-size: 5rem; bottom: -5px; } \/* Prevent overlap *\/\n .pp-panels { padding: 1.5rem 1.2rem; }\n .pp-timeline li { grid-template-columns: 1fr; gap: 0.2rem; padding: 1rem 0; }\n .pp-pub-item { grid-template-columns: 25px 1fr; }\n }\n ::-webkit-scrollbar { width: 5px; } ::-webkit-scrollbar-track { background: transparent; } ::-webkit-scrollbar-thumb { background: var(--rule); }\n<\/style>\n<\/head>\n<body>\n\n<div class=\"pp-block\">\n\n <div class=\"pp-hero\">\n <img decoding=\"async\" class=\"pp-hero-photo\" src=\"http:\/\/mrc-baku.org\/wp\/wp-content\/uploads\/2026\/03\/TurkerBiyikoglu-1024x1016.jpeg\" alt=\"T\u00fcrker B\u0131y\u0131ko\u011flu\">\n <div class=\"pp-hero-info\">\n <div class=\"pp-hero-tag\">Senior Researcher<\/div>\n <div class=\"pp-hero-name\">T\u00fcrker B\u0131y\u0131ko\u011flu<\/div>\n <div class=\"pp-hero-role\">Graph Theory and its Applications Group<\/div>\n <div class=\"pp-hero-meta\"> \n <a class=\"pp-hero-link\" href=\"mailto:turker.biyikoglu@asoiu.edu.az\">turker.biyikoglu@asoiu.edu.az<\/a>\n <a class=\"pp-hero-link\" href=\"mailto:tbiyikoglu@agmail.com\">tbiyikoglu@agmail.com<\/a>\n <a class=\"pp-hero-link\" href=\"https:\/\/orcid.org\/0009-0009-4499-1938\">ORCID<\/a>\n <a class=\"pp-hero-link\" href=\"https:\/\/scholar.google.com\/citations?user=jpUHb10AAAAJ&hl=en\">Google Scholar<\/a>\n <\/div>\n <\/div>\n <\/div>\n\n <nav class=\"pp-nav\" role=\"tablist\">\n <button class=\"pp-tab active\" data-panel=\"research\">Research<\/button>\n <button class=\"pp-tab\" data-panel=\"awards\">Awards & Projects<\/button>\n <button class=\"pp-tab\" data-panel=\"publications\">Publications<\/button>\n <button class=\"pp-tab\" data-panel=\"service\">Service<\/button>\n <\/nav>\n\n <div class=\"pp-panels\">\n\n <section class=\"pp-panel active\" id=\"panel-research\">\n <div class=\"pp-section-label\">Research Interests<\/div>\n <p class=\"pp-research-intro\">My research interests include graph theory, graph modelling, and graph applications. <\/p>\n <\/section>\n\n <section class=\"pp-panel\" id=\"panel-awards\">\n <div class=\"pp-section-label\">Awards<\/div>\n <ul class=\"pp-timeline\">\n <li>\n <span class=\"tl-year\">2015<\/span>\n <span class=\"tl-body\"><strong>Masatoshi G\u00fcnd\u00fcz \u0130keda Research Award<\/strong>, <em>T\u00fcrk Matematik Vakf\u0131 (Turkish Mathematical Foundation)<\/em><\/span>\n <\/li>\n <li>\n <span class=\"tl-year\">2009<\/span>\n <span class=\"tl-body\"><strong>Distinguished Young Scholar Award<\/strong> (TUBA-GEBIP\/2009), <em>Turkish Academy of Sciences<\/em><\/span>\n <\/li>\n <\/ul>\n\n <div class=\"pp-section-label pp-mt\">Research Projects with Funding<\/div>\n <ul class=\"pp-timeline\">\n <li>\n <span class=\"tl-year\">2011 \u2013 2014<\/span>\n <span class=\"tl-body\">\n <strong>“Geometric representations and symmetries of graphs, maps and other discrete structures and applications in science” (GReGAS)<\/strong><br>\n Supported by T\u00dcB\u0130TAK and the European Science Foundation (EUROCORES Programme EUROGIGA) \u2014 Principal Researcher<br>\n <em>Supported: Lale \u00d6zkahya (post-doc)<\/em>\n <\/span>\n <\/li>\n <li>\n <span class=\"tl-year\">2012 \u2013 2014<\/span>\n <span class=\"tl-body\">\n <strong>“Castelnuovo-Mumford Regularity of Graphs and Topology of Decycling Complexes”<\/strong><br>\n Supported by T\u00dcB\u0130TAK \u2014 Joint project with Yusuf Civan (S\u00fcleyman Demirel University, Isparta, Turkey)\n <\/span>\n <\/li>\n <li>\n <span class=\"tl-year\">2012 \u2013 2014<\/span>\n <span class=\"tl-body\">\n <strong>“Bionetalign: Global Alignment of Biochemical Networks Regularity for Functional Orthology”<\/strong><br>\n Supported by T\u00dcB\u0130TAK \u2014 Joint project with Cesim Erten (Kadir Has University, Istanbul, Turkey)\n <\/span>\n <\/li>\n <\/ul>\n <\/section>\n\n <section class=\"pp-panel\" id=\"panel-publications\">\n\n <div class=\"pp-pub-group\">\n <div class=\"pp-section-label\">Book<\/div>\n <ul class=\"pp-pub-list\">\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Laplacian Eigenvectors of Graphs<\/div>\n <div class=\"pp-pub-authors\">T. B\u0131y\u0131ko\u011flu, J. Leydold and P. F. Stadler<\/div>\n <div class=\"pp-pub-venue\">Lecture Notes in Mathematics 1915, Springer (2007)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"https:\/\/link.springer.com\/book\/10.1007\/978-3-540-73510-6\n\" target=\"_blank\" rel=\"noopener\">Publisher<\/a><\/div>\n \n <\/div>\n <\/li>\n <\/ul>\n <\/div>\n\n <div class=\"pp-pub-group\">\n <div class=\"pp-section-label\">Journal Publications<\/div>\n <ul class=\"pp-pub-list\">\n <li class=\"pp-pub-item\">\n<span class=\"pp-pub-num\">●<\/span>\n<div>\n <div class=\"pp-pub-title\">Graph entropy, degree assortativity, and hierarchical structures in networks<\/div>\n <div class=\"pp-pub-authors\">Fatihcan M. Atay, T\u00fcrker B\u0131y\u0131ko\u011flu<\/div>\n <div class=\"pp-pub-venue\">Phys. Rev. E 112, 064315 (2025)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"<a href=\"https:\/\/doi.org\/10.1103\/6kxf-qn44\"_blank\" rel=\"noopener\">Publisher<\/a> <\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n<span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Structure of conflict graphs in constraint alignment problems and algorithms<\/div>\n <div class=\"pp-pub-authors\">F. Alkan, T. B\u0131y\u0131ko\u011flu, M. Demange and C. Erten<\/div>\n <div class=\"pp-pub-venue\">Discrete Mathematics & Theoretical Computer Science, 21 no.4 (2019)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"https:\/\/dmtcs.episciences.org\/5755\n\"_blank\" rel=\"noopener\">Publisher<\/a> <\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Prime Graphs, Matching and the Castelnuovo-Mumford Regularity<\/div>\n <div class=\"pp-pub-authors\">T. B\u0131y\u0131ko\u011flu and Y. Civan<\/div>\n <div class=\"pp-pub-venue\">Journal of Commutative Algebra, 11: 1\u201327 (2019)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"https:\/\/projecteuclid.org\/journals\/journal-of-commutative-algebra\/volume-11\/issue-1\/Prime-graphs-matchings-and-the-Castelnuovo-Mumford-regularity\/10.1216\/JCA-2019-11-1-1.full\n\"_blank\" rel=\"noopener\">Publisher<\/a><\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Castelnuovo-Mumford Regularity of Graphs<\/div>\n <div class=\"pp-pub-authors\">T. B\u0131y\u0131ko\u011flu and Y. Civan<\/div>\n <div class=\"pp-pub-venue\">Combinatorica, 38: 1353\u20131383 (2018)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"https:\/\/link.springer.com\/article\/10.1007\/s00493-017-3450-1\"_blank\" rel=\"noopener\">Publisher<\/a><\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Vertex Decomposable Graphs, Codismantlability, Cohen-Macaulayness and Castelnuovo-Mumford Regularity<\/div>\n <div class=\"pp-pub-authors\">T. B\u0131y\u0131ko\u011flu and Y. Civan<\/div>\n <div class=\"pp-pub-venue\">Electronic Journal of Combinatorics, 21: #P1.1 (2014)<\/div>\n\t\t<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v21i1p1\n\"_blank\" rel=\"noopener\">Publisher<\/a><\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">CAMPways: constrained alignment framework for the comparative analysis of a pair of metabolic pathways<\/div>\n <div class=\"pp-pub-authors\">G. Abaka, T. B\u0131y\u0131ko\u011flu, C. Erten<\/div>\n <div class=\"pp-pub-venue\">Bioinformatics, 29: 145\u2013153 (2013)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"https:\/\/academic.oup.com\/bioinformatics\/article\/29\/13\/i145\/197346\n\"_blank\" rel=\"noopener\">Publisher<\/a><\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Four-cycled graphs with topological applications<\/div>\n <div class=\"pp-pub-authors\">T. B\u0131y\u0131ko\u011flu and Y. Civan<\/div>\n <div class=\"pp-pub-venue\">Annals of Combinatorics, 16: 37\u201356 (2012)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"https:\/\/link.springer.com\/article\/10.1007\/s00026-011-0120-7\n\"_blank\" rel=\"noopener\">Publisher<\/a><\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Dendrimers are the unique chemical trees with maximum spectral radius<\/div>\n <div class=\"pp-pub-authors\">T. B\u0131y\u0131ko\u011flu and J. Leydold<\/div>\n <div class=\"pp-pub-venue\">MATCH Communications in Mathematical and in Computer Chemistry, 68: 851\u2013854 (2012)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"https:\/\/match.pmf.kg.ac.rs\/electronic_versions\/Match68\/n3\/match68n3_851-854.pdf\n\"_blank\" rel=\"noopener\">Publisher<\/a><\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Graphs of given order and size and minimum algebraic connectivity<\/div>\n <div class=\"pp-pub-authors\">T. B\u0131y\u0131ko\u011flu and J. Leydold<\/div>\n <div class=\"pp-pub-venue\">Linear Algebra and its Applications, 436: 2067\u20132077 (2012)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0024379511006628\n\"_blank\" rel=\"noopener\">Publisher<\/a><\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Some Notes on Spectra of Cographs<\/div>\n <div class=\"pp-pub-authors\">T. B\u0131y\u0131ko\u011flu, S. Simi\u0107, Z. Stani\u0107<\/div>\n <div class=\"pp-pub-venue\">Ars Combinatoria, 100: 421\u2013434 (2011)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"https:\/\/combinatorialpress.com\/ars-articles\/volume-100-ars-articles\/some-notes-on-spectra-of-cographs\/\n\"_blank\" rel=\"noopener\">Publisher<\/a><\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Cryptanalysis of Fridrich’s image encryption<\/div>\n <div class=\"pp-pub-authors\">E. Solak, C. Cokal, O. T. Yildiz, T. B\u0131y\u0131ko\u011flu<\/div>\n <div class=\"pp-pub-venue\">International Journal of Bifurcation and Chaos, 20: 1405\u20131413 (2010)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0218127410026563\n\"_blank\" rel=\"noopener\">Publisher<\/a><\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Semiregular trees with minimal Laplacian spectral radius<\/div>\n <div class=\"pp-pub-authors\">T. B\u0131y\u0131ko\u011flu and J. Leydold<\/div>\n <div class=\"pp-pub-venue\">Linear Algebra and its Applications, 432: 2335\u20132341 (2010)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0024379509003085\n\"_blank\" rel=\"noopener\">Publisher<\/a><\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Discovering Cis-Regulatory Modules by optimizing Barbecues<\/div>\n <div class=\"pp-pub-authors\">A. Mosig, T. B\u0131y\u0131ko\u011flu, S. J. Prohaska, and P. F. Stadler<\/div>\n <div class=\"pp-pub-venue\">Discrete Applied Mathematics, 157: 2458\u20132468 (2009)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0166218X08003570\n\"_blank\" rel=\"noopener\">Publisher<\/a><\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Largest Eigenvalues of the Discrete \\(p\\)-Laplacian of Trees with Degree Sequences<\/div>\n <div class=\"pp-pub-authors\">T. B\u0131y\u0131ko\u011flu, M. Hellmuth, and J. Leydold<\/div>\n <div class=\"pp-pub-venue\">Electronic Journal of Linear Algebra, 18: 202\u2013210 (2009)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"https:\/\/journals.uwyo.edu\/index.php\/ela\/article\/view\/611\"_blank\" rel=\"noopener\">Publisher<\/a><\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Algebraic Connectivity and Degree Sequences of Trees<\/div>\n <div class=\"pp-pub-authors\">T. B\u0131y\u0131ko\u011flu and J. Leydold<\/div>\n <div class=\"pp-pub-venue\">Linear Algebra and its Applications, 430: 811\u2013817 (2009)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0024379508004680\n\"_blank\" rel=\"noopener\">Publisher<\/a><\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Graphs with given degree sequence and maximal spectral radius<\/div>\n <div class=\"pp-pub-authors\">T. B\u0131y\u0131ko\u011flu and J. Leydold<\/div>\n <div class=\"pp-pub-venue\">Electronic Journal of Combinatorics, 15: R119 (2008)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v15i1r119\n\"_blank\" rel=\"noopener\">Publisher<\/a><\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Faber-Krahn Type Inequalities for Trees<\/div>\n <div class=\"pp-pub-authors\">T. B\u0131y\u0131ko\u011flu and J. Leydold<\/div>\n <div class=\"pp-pub-venue\">Journal of Combinatorial Theory, Series B, 97: 159\u2013174 (2007)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0095895606000499\n\"_blank\" rel=\"noopener\">Publisher<\/a><\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Network synchronization: Spectral versus statistical properties<\/div>\n <div class=\"pp-pub-authors\">F. M. Atay, T. B\u0131y\u0131ko\u011flu, J. Jost<\/div>\n <div class=\"pp-pub-venue\">Physica D, 224: 35\u201341 (2006)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"https:\/\/www.sciencedirect.com\/science\/article\/abs\/pii\/S0167278906003794\n\"_blank\" rel=\"noopener\">Publisher<\/a><\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Synchronization of Networks with Prescribed Degree Distributions<\/div>\n <div class=\"pp-pub-authors\">F. M. Atay, T. B\u0131y\u0131ko\u011flu, J. Jost<\/div>\n <div class=\"pp-pub-venue\">IEEE Transactions on Circuits and Systems I, 53: 92\u201398 (2006)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"https:\/\/ieeexplore.ieee.org\/document\/1576889\n\"_blank\" rel=\"noopener\">Publisher<\/a><\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Synchronization of Complex Networks under Graph Operations<\/div>\n <div class=\"pp-pub-authors\">F. M. Atay, T. B\u0131y\u0131ko\u011flu<\/div>\n <div class=\"pp-pub-venue\">Physical Review E, 72: 016217 (2005)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"https:\/\/journals.aps.org\/pre\/abstract\/10.1103\/PhysRevE.72.016217\n\"_blank\" rel=\"noopener\">Publisher<\/a><\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Nodal Domains and Bipartite Subgraphs<\/div>\n <div class=\"pp-pub-authors\">T. B\u0131y\u0131ko\u011flu, J. Leydold, and P. F. Stadler<\/div>\n <div class=\"pp-pub-venue\">Electronic Journal of Linear Algebra, 13: 344\u2013351 (2005)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"https:\/\/journals.uwyo.edu\/index.php\/ela\/article\/view\/335\n\"_blank\" rel=\"noopener\">Publisher<\/a><\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Degree sequences of Halin graphs and forcibly cograph graphic sequences<\/div>\n <div class=\"pp-pub-authors\">T. B\u0131y\u0131ko\u011flu<\/div>\n <div class=\"pp-pub-venue\">Ars Combinatoria, 75: 205\u2013210 (2005)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"https:\/\/combinatorialpress.com\/ars-articles\/volume-075-ars-articles\/degree-sequences-of-halin-graphs-and-forcibly-cograph-graphic-sequences\/\n\"_blank\" rel=\"noopener\">Publisher<\/a><\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Graph Laplacians, Nodal Domain, and Hyperplane Arrangements<\/div>\n <div class=\"pp-pub-authors\">T. B\u0131y\u0131ko\u011flu, W. Hordijk, J. Leydold, T. Pisanski, P. F. Stadler<\/div>\n <div class=\"pp-pub-venue\">Linear Algebra and its Applications, 390: 155\u2013174 (2004)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0024379504002113\n\"_blank\" rel=\"noopener\">Publisher<\/a><\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">A Discrete Nodal Domain Theorem for Trees<\/div>\n <div class=\"pp-pub-authors\">T. B\u0131y\u0131ko\u011flu<\/div>\n <div class=\"pp-pub-venue\">Linear Algebra and its Applications, 360: 197\u2013205 (2003)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0024379502004512\n\"_blank\" rel=\"noopener\">Publisher<\/a><\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">A counterexample to a conjecture of Erd\u0151s<\/div>\n <div class=\"pp-pub-authors\">T. B\u0131y\u0131ko\u011flu<\/div>\n <div class=\"pp-pub-venue\">Discrete Mathematics, 250: 231\u2013232 (2002)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0012365X00001588\n\"_blank\" rel=\"noopener\">Publisher<\/a><\/div>\n <\/div>\n <\/li>\n <\/ul>\n <\/div>\n\n <div class=\"pp-pub-group\">\n <div class=\"pp-section-label\">Conference Proceedings<\/div>\n <ul class=\"pp-pub-list\">\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Enabling Cooperation, Resource Allocation and Receiver Selection Across Cells: Complementary Fractional Frequency Reuse<\/div>\n <div class=\"pp-pub-authors\">S. Baksi, O. Kaya and T. B\u0131y\u0131ko\u011flu<\/div>\n <div class=\"pp-pub-venue\">IEEE PIMRC 2013, London, UK, Sept. 2013<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"https:\/\/ieeexplore.ieee.org\/document\/6666319\"_blank\" rel=\"noopener\">Publisher<\/a>\n <\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Optimal and Near-optimal Partner Selection Algorithms in Cooperative OFDMA<\/div>\n <div class=\"pp-pub-authors\">S. Baksi, O. Kaya, T. B\u0131y\u0131ko\u011flu<\/div>\n <div class=\"pp-pub-venue\">IEEE WCNC 2012, Paris, France, April 2012<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"https:\/\/ieeexplore.ieee.org\/document\/6214413\"_blank\" rel=\"noopener\">Publisher<\/a>\n <\/div>\n <\/div>\n <\/li>\n <\/ul>\n <\/div>\n\n <div class=\"pp-pub-group\">\n <div class=\"pp-section-label\">Preprints<\/div>\n <ul class=\"pp-pub-list\">\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Bounding the collapsibility number of simplicial complexes and graphs<\/div>\n <div class=\"pp-pub-authors\">T. B\u0131y\u0131ko\u011flu and Y. Civan<\/div>\n <div class=\"pp-pub-venue\">Preprint (2023)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link arxiv\" href=\"https:\/\/arxiv.org\/abs\/2201.13046\" target=_blank\" rel=\"noopener\">Arxiv<\/a>\n <\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Projective dimension of (hyper)graphs and the Castelnuovo-Mumford regularity of bipartite graphs<\/div>\n <div class=\"pp-pub-authors\">T. B\u0131y\u0131ko\u011flu and Y. Civan<\/div>\n <div class=\"pp-pub-venue\">Preprint (2016)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link arxiv\" href=\"https:\/\/arxiv.org\/abs\/1605.02956\" target=_blank\" rel=\"noopener\">Arxiv<\/a>\n <\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">A note on the recognition of codismantlable graphs and posets<\/div>\n <div class=\"pp-pub-authors\">T. B\u0131y\u0131ko\u011flu and Y. Civan<\/div>\n <div class=\"pp-pub-venue\">Preprint (2016)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publisher\" href=\"https:\/\/mrc-baku.org\/wp-content\/uploads\/2026\/04\/codis-graphs-posets.pdf\" target=_blank\" rel=\"noopener\">PDF<\/a>\n <\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Bounding Castelnuovo-Mumford regularity of graphs via Lozin’s transformation<\/div>\n <div class=\"pp-pub-authors\">T. B\u0131y\u0131ko\u011flu and Y. Civan<\/div>\n <div class=\"pp-pub-venue\">Preprint (2013)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link arxiv\" href=\"https:\/\/arxiv.org\/abs\/1302.3064\" target=_blank\" rel=\"noopener\">Arxiv<\/a>\n <\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Semiregular Trees with Minimal Index<\/div>\n <div class=\"pp-pub-authors\">T. B\u0131y\u0131ko\u011flu and J. Leydold<\/div>\n <div class=\"pp-pub-venue\">Preprint (2009)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link arxiv\" href=\"https:\/\/arxiv.org\/abs\/0906.1517\" target=_blank\" rel=\"noopener\">Arxiv<\/a>\n <\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Largest Laplacian Eigenvalue and Degree Sequences of Trees<\/div>\n <div class=\"pp-pub-authors\">T. B\u0131y\u0131ko\u011flu, M. Hellmuth, J. Leydold<\/div>\n <div class=\"pp-pub-venue\">Preprint (2007)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link arxiv\" href=\"https:\/\/arxiv.org\/abs\/0804.2776\" target=_blank\" rel=\"noopener\">Arxiv<\/a>\n <\/div>\n <\/div>\n <\/li>\n <li class=\"pp-pub-item\">\n <span class=\"pp-pub-num\">●<\/span>\n <div>\n <div class=\"pp-pub-title\">Rank and number of nodal domains of cographs<\/div>\n <div class=\"pp-pub-authors\">T. B\u0131y\u0131ko\u011flu<\/div>\n <div class=\"pp-pub-venue\">Preprint (2002)<\/div>\n<div class=\"pub-links\">\n <a class=\"pub-link publiseher\" href=\"https:\/\/mrc-baku.org\/wp-content\/uploads\/2026\/04\/rank_cograph.pdf\" target=_blank\" rel=\"noopener\">PDF<\/a>\n <\/div>\n <\/li>\n <\/ul>\n <\/div>\n\n\n <\/section>\n\n <section class=\"pp-panel\" id=\"panel-service\">\n <div class=\"pp-section-label\">Industrial Research<\/div>\n <div class=\"pp-prose\">\n <p>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.<\/p>\n <\/div>\n\n <div class=\"pp-section-label pp-mt\">Seminar & Workshop Organisation<\/div>\n <ul class=\"pp-timeline\">\n <li>\n <span class=\"tl-year\">2009 \u2013 2012<\/span>\n <span class=\"tl-body\">\n <strong>Monthly Istanbul Discrete Mathematics Meetings<\/strong><br>\n <em>Istanbul Center for Mathematical Sciences, Bo\u011fazi\u00e7i University (with T. Ekim)<\/em>\n <\/span>\n <\/li>\n <li>\n <span class=\"tl-year\">2010, 2011, 2012<\/span>\n <span class=\"tl-body\">\n <strong>Workshop on Graph Theory and its Applications I, II, III<\/strong><br>\n <em>Istanbul (with T. Ekim)<\/em>\n <\/span>\n <\/li>\n <\/ul>\n\n <div class=\"pp-section-label pp-mt\">Editorial Service<\/div>\n <ul class=\"pp-timeline\">\n <li>\n <span class=\"tl-year\">2017 \u2013 2020<\/span>\n <span class=\"tl-body\"><strong>Guest Editor<\/strong>, <em>Matematik D\u00fcnyas\u0131<\/em> \u2014 Turkish popular mathematics journal<\/span>\n <\/li>\n <\/ul>\n <\/section>\n\n <\/div><\/div><script>\ndocument.querySelectorAll('.pp-tab').forEach(function(tab) {\n tab.addEventListener('click', function() {\n var panel = tab.dataset.panel;\n document.querySelectorAll('.pp-tab').forEach(function(t) { t.classList.remove('active'); });\n document.querySelectorAll('.pp-panel').forEach(function(p) { p.classList.remove('active'); });\n tab.classList.add('active');\n document.getElementById('panel-' + panel).classList.add('active');\n });\n});\n<\/script>\n\n<\/body>\n<\/html>\n\n\n\n<p><\/p>\n","protected":false},"excerpt":{"rendered":"<p>T\u00fcrker B\u0131y\u0131ko\u011flu \u2014 Mathematics Research Center Senior Researcher T\u00fcrker B\u0131y\u0131ko\u011flu Graph Theory and its Applications Group turker.biyikoglu@asoiu.edu.az tbiyikoglu@agmail.com ORCID Google Scholar Research Awards & Projects Publications Service Research Interests My research interests include graph theory, graph modelling, and graph applications. Awards 2015 Masatoshi G\u00fcnd\u00fcz \u0130keda Research Award, T\u00fcrk Matematik Vakf\u0131 (Turkish Mathematical Foundation) 2009 Distinguished […]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-130","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/mrc-baku.org\/index.php\/wp-json\/wp\/v2\/pages\/130","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/mrc-baku.org\/index.php\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/mrc-baku.org\/index.php\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/mrc-baku.org\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/mrc-baku.org\/index.php\/wp-json\/wp\/v2\/comments?post=130"}],"version-history":[{"count":23,"href":"https:\/\/mrc-baku.org\/index.php\/wp-json\/wp\/v2\/pages\/130\/revisions"}],"predecessor-version":[{"id":665,"href":"https:\/\/mrc-baku.org\/index.php\/wp-json\/wp\/v2\/pages\/130\/revisions\/665"}],"wp:attachment":[{"href":"https:\/\/mrc-baku.org\/index.php\/wp-json\/wp\/v2\/media?parent=130"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}