Ahmet Sinan Cevik

Prof. Dr. Ahmet Sinan Cevik

Selcuk University, Science Faculty, Department of Mathematics
orcid

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
16 January 2021 in Symmetry
Verified
Journal Article
Open access
PDF file
Kinkar Chandra DasKinkar Chandra Das
Kinkar Chandra Das
Ahmet Sinan CevikAhmet Sinan Cevik
Ahmet Sinan Cevik
Ismail Naci CANGULIsmail Naci CANGUL
Ismail Naci CANGUL
Yilun ShangYilun Shang
Yilun Shang
The concept of Sombor index (SO) was recently introduced by Gutman in the chemical graph theory. It is a vertex-degree-based topological index and is denoted by Sombor index SO: SO=SO(G)=∑vivj∈E(G)dG(vi)2+dG(vj)2, where dG(vi) is the degree of vertex vi in G. Here, we present novel lower and upper bounds on the Sombor index of graphs by using some graph parameters. Moreover, we obtain several relations on Sombor index with the first and second Zagreb indices of graphs. Finally, we give some conclusions and propose future work.

1 January 2016 in Analele ştiinţifice ale Universităţii "Ovidius" Constanţa. Seria Matematică
Verified
Journal Article
Open access
PDF file
Kinkar Chandra DasKinkar Chandra Das
Kinkar Chandra Das
NANihat Akgunes
Nihat Akgunes
MTMuge Togan
Muge Togan
AYAysun Yurttas
Aysun Yurttas
Ismail Naci CANGULIsmail Naci CANGUL
Ismail Naci CANGUL
Ahmet Sinan CevikAhmet Sinan Cevik
Ahmet Sinan Cevik
For a (molecular) graph G with vertex set V (G) and edge set E(G), the first Zagreb index of G is defined as , where d G (v i ) is the degree of vertex vi in G. Recently Xu et al. introduced two graphical invariants and named as first multiplicative Zagreb coindex and second multiplicative Zagreb coindex, respectively. The Narumi-Katayama index of a graph G, denoted by NK(G), is equal to the product of the degrees of the vertices of G, that is, NK(G) = . The irregularity index t(G) of G is defined as the number of distinct terms in the degree sequence of G. In this paper, we give some lower and upper bounds on the first Zagreb index M1(G) of graphs and trees in terms of number of vertices, irregularity index, maxi- mum degree, and characterize the extremal graphs. Moreover, we obtain some lower and upper bounds on the (first and second) multiplicative Zagreb coindices of graphs and characterize the extremal graphs. Finally, we present some relations between first Zagreb index and Narumi-Katayama index, and (first and second) multiplicative Zagreb index and coindices of graphs.

1 April 2011 in Discrete Mathematics
Verified
Journal Article
Closed access
PDF file
FAFırat Ateş
Fırat Ateş
EKEylem G. Karpuz
Eylem G. Karpuz
CKCanan Kocapınar
Canan Kocapınar
Ahmet Sinan CevikAhmet Sinan Cevik
Ahmet Sinan Cevik

18 November 2016 in Proceedings of the National Academy of Sciences, India Section A: Physical Sciences
Verified
Journal Article
Closed access
PDF file
Kinkar Chandra DasKinkar Chandra Das
Kinkar Chandra Das
AMA. Dilek Maden
A. Dilek Maden
Ismail Naci CANGULIsmail Naci CANGUL
Ismail Naci CANGUL
Ahmet Sinan CevikAhmet Sinan Cevik
Ahmet Sinan Cevik

19 August 2020 in Symmetry
Verified
Journal Article
Open access
PDF file
AGAysun Yurttas Gunes
Aysun Yurttas Gunes
SDSadik Delen
Sadik Delen
ICIsmail Naci Cangul
Ismail Naci Cangul
Ahmet Sinan CevikAhmet Sinan Cevik
Ahmet Sinan Cevik
Ismail Naci CANGULIsmail Naci CANGUL
Ismail Naci CANGUL
Apart from its applications in Chemistry, Biology, Physics, Social Sciences, Anthropology, etc., there are close relations between graph theory and other areas of Mathematics. Fibonacci numbers are of utmost interest due to their relation with the golden ratio and also due to many applications in different areas from Biology, Architecture, Anatomy to Finance. In this paper, we define Fibonacci graphs as graphs having degree sequence consisting of n consecutive Fibonacci numbers and use the invariant Ω to obtain some more information on these graphs. We give the necessary and sufficient conditions for the realizability of a set D of n successive Fibonacci numbers for every n and also list all possible realizations called Fibonacci graphs for 1≤n≤4.

1 February 2014 in Linear Algebra and its Applications
Verified
Journal Article
Closed access
Kinkar Chandra DasKinkar Chandra Das
Kinkar Chandra Das
Ivan GutmanIvan Gutman
Ivan Gutman
Ahmet Sinan CevikAhmet Sinan Cevik
Ahmet Sinan Cevik