Çınkır, Zübeyir

Profile URL
https://hdl.handle.net/20.500.12573/2661
Name Variants
Cinkir, Zubeyir Z Çinkir
Job Title
Doç. Dr.
Email Address
zubeyir.cinkir@agu.edu.tr
Main Affiliation
02.02. Endüstri Mühendisliği
Status
Current Staff
Website
ORCID ID
0009-0007-7960-688X
Scopus Author ID
6506110381
Turkish CoHE Profile ID
F45A0D385A89575E
Google Scholar ID
WoS Researcher ID
EPW-3218-2022
No research topics data found.

Sustainable Development Goals

SDG data is not available
Documents

18

Citations

213

h-index

8

Go to Scopus profile
Documents

19

Citations

209

Go to WoS profile
No records found in other affiliations.
Scholarly Output

7

Articles

7

Views / Downloads

5/40

Supervised MSc Theses

0

Supervised PhD Theses

0

WoS Citation Count

49

Scopus Citation Count

49

Patents

0

Projects

0

WoS Citations per Publication

7.00

Scopus Citations per Publication

7.00

Open Access Source

1

Supervised Theses

0

JournalCount
Annals of Combinatorics1
Indian Journal of Pure & Applied Mathematics1
Journal of Mathematical Chemistry1
Journal of the Ramanujan Mathematical Society1
Manuscripta Mathematica1
Current Page: 1 / 2

Scopus Quartile Distribution

Competency Cloud

GCRIS Competency Cloud
Author of Publication: search.filters.isAuthorOfPublication.9d31d662-63e3-49ee-b9b8-45a8f160aca6

Scholarly Output Search Results

Now showing 1 - 7 of 7
  • Article
    Citation - WoS: 6
    Citation - Scopus: 6
    Admissible Invariants of Genus 3 Curves
    (Springer Heidelberg, 2015-06-03) Cinkir, Zubeyir
    Several invariants of polarized metrized graphs and their applications in Arithmetic Geometry are studied recently. In this paper, we explicitly calculated these admissible invariants for all curves of genus 3. We find the sharp lower bound for the invariants phi, lambda and epsilon for all polarized metrized graphs of genus 3. This improves the lower bound given for Effective Bogomolov Conjecture for such curves.
  • Article
    Citation - WoS: 11
    Citation - Scopus: 10
    Contraction Formulas for the Kirchhoff and Wiener Indices
    (Univ Kragujevac, Fac Science, 2016) Cinkir, Zubeyir
    We relate the Kirchhoff index with some other metrized graph invariants. We establish several contraction formulas for the Kirchhoff index. We use these contraction formulas and certain edge densities to give new upper and lower bounds to the Kirchhoff index for any connected graph. As an another application of our contraction formulas when the graph is a tree, we derive new formulas as well as previously known formulas for the Wiener index with new proofs.
  • Article
    Citation - WoS: 26
    Citation - Scopus: 27
    Effective Resistances and Kirchhoff Index of Ladder Graphs
    (Springer, 2016-01-21) Cinkir, Zubeyir
    We explicitly compute the effective resistances between any two vertices of a ladder graph by using circuit reductions. Using our findings, we obtain explicit formulas for Kirchhoff index of a ladder graph. Comparing our formula for Kirchhoff index and previous results in the literature, we obtain an explicit sum formula involving trigonometric functions. We also expressed our formulas in terms of certain generalized Fibonacci numbers that are the values of the Chebyshev polynomials of the second kind at 2.
  • Article
    An Elementary Proof of Lucas's Theorem
    (Ramanujan Mathematical Society, 2025) Cinkir, Zubeyir
    Lucas's Theorem is about finding the result of a binomial coefficient modulo a prime p efficiently. The result is expressed as a product of binomial coefficients involving the base p expansions of the parameters of the original binomial coefficient. We give an elementary proof of Lucas's Theorem by deriving an analogous Vander-monde identity modulo a prime number.
  • Article
    An Extension of Lucas's Theorem
    (indian Nat Sci Acad, 2025-10-31) Cinkir, Zubeyir; Ozturkalan, Aysegul
    We give elementary proofs of some congruence criteria to compute binomial coefficients modulo a prime number. These criteria are analogues to the symmetry property of binomial coefficients. We give extended version of Lucas's Theorem by using those criteria. We give applications of these criteria by describing a method to derive identities and congruences involving sums of binomial coefficients.
  • Article
    Citation - WoS: 3
    Citation - Scopus: 3
    Computation of Polarized Metrized Graph Invariants by Using Discrete Laplacian Matrix
    (Amer Mathematical Soc, 2015-05-08) Cinkir, Zubeyir
    Several invariants of polarized metrized graphs and their applications in Arithmetic Geometry have been studied recently. In this paper, we give fast algorithms to compute these invariants by expressing them in terms of the discrete Laplacian matrix and its pseudo inverse. The algorithm we give can be used for both symbolic and numerical computations. We present various examples to illustrate the implementation of these algorithms.
  • Article
    Citation - WoS: 3
    Citation - Scopus: 3
    Families of Metrized Graphs With Small Tau Constants
    (Springer Basel Ag, 2016-01-23) Cinkir, Zubeyir
    Baker and Rumely's tau lower bound conjecture claims that if the tau constant of a metrized graph is divided by its total length, this ratio must be bounded below by a positive constant for all metrized graphs. We construct several families of metrized graphs having small tau constants. In addition to numerical computations, we prove that the tau constants of the metrized graphs in one of these families, the hexagonal nets around a torus, asymptotically approach to 108 which is our conjectural lower bound.