Aysun Yurttas Gunes

Prof. Aysun Yurttas Gunes

orcid

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
26 October 2018 in Journal of Mathematical Chemistry
Verified
Journal Article
Closed access
PDF file
AGAysun Yurttas Gunes
Aysun Yurttas Gunes
MTMuge Togan
Muge Togan
Lokesha VeerabhadraiahLokesha Veerabhadraiah
Lokesha Veerabhadraiah
Ismail Naci CANGULIsmail Naci CANGUL
Ismail Naci CANGUL
Ivan GutmanIvan Gutman
Ivan Gutman

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 December 2020 in Applicable Analysis and Discrete Mathematics
Verified
Journal Article
Open access
PDF file
SDSadik Delen
Sadik Delen
MTMuge Togan
Muge Togan
AGAysun Yurttas Gunes
Aysun Yurttas Gunes
UAUgur Ana
Ugur Ana
Ismail Naci CANGULIsmail Naci CANGUL
Ismail Naci CANGUL
Recently the first and last authors defined a new graph characteristic called omega related to Euler characteristic to determine several topological and combinatorial properties of a given graph. This new characteristic is defined in terms of a given degree sequence as a graph invariant and gives a lot of information on the realizability, number of realizations, connectedness, cyclicness, number of components, chords, loops, pendant edges, faces, bridges etc. of the family of realizations. In this paper, the effect of the deletion of vertices and edges from a graph on omega invariant is studied.

1 January 2020 in Filomat
Verified
Journal Article
Open access
PDF file
MTMuge Togan
Muge Togan
AGAysun Yurttas Gunes
Aysun Yurttas Gunes
USUtkum Sanli
Utkum Sanli
FCFeriha Celik
Feriha Celik
Ismail Naci CANGULIsmail Naci CANGUL
Ismail Naci CANGUL
Due to their applications in many branches of science, topological graph indices are becoming more popular every day. Especially as one can model chemical molecules by graphs to obtain valuable information about the molecules using solely mathematical calculations on the graph. The inverse problem for topological graph indices is a recent problem proposed by Gutman and is about the existence of a graph having its index value equal to a given non-negative integer. In this paper, the inverse problem for Bell index which is one of the irregularity indices is solved. Also a recently defined graph invariant called omega invariant is used to obtain several properties related to the Bell index.

1 February 2024 in Symmetry
Verified
Journal Article
Open access
PDF file
AGAysun Yurttas Gunes
Aysun Yurttas Gunes
HAHacer Ozden Ayna
Hacer Ozden Ayna
Ismail Naci CANGULIsmail Naci CANGUL
Ismail Naci CANGUL
A vertex degree based topological index called the Sombor index was recently defined in 2021 by Gutman and has been very popular amongst chemists and mathematicians. We determine the amount of change of the Sombor index when some elements are removed from a graph. This is done for several graph elements, including a vertex, an edge, a cut vertex, a pendant edge, a pendant path, and a bridge in a simple graph. Also, pendant and non-pendant cases are studied. Using the obtained formulae successively, one can find the Sombor index of a large graph by means of the Sombor indices of smaller graphs that are just graphs obtained after removal of some vertices or edges. Sometimes, using iteration, one can manage to obtain a property of a really large graph in terms of the same property of many other subgraphs. Here, the calculations are made for a pendant and non-pendant vertex, a pendant and non-pendant edge, a pendant path, a bridge, a bridge path from a simple graph, and, finally, for a loop and a multiple edge from a non-simple graph. Using these results, the Sombor index of cyclic graphs and tadpole graphs are obtained. Finally, some Nordhaus–Gaddum type results are obtained for the Sombor index.

1 January 2025 in AIMS Mathematics
Verified
Journal Article
Open access
PDF file
AGAysun Yurttas Gunes
Aysun Yurttas Gunes
HBHalim Benali
Halim Benali
MSMohammed Said Souid
Mohammed Said Souid
In this paper, we introduce a modified Elzaki transform and its generalization, namely the Elzaki transform, and its own convolution theorem is given. These generalization are given by composition with a monotonic increasing function $ \varrho $ having a continuous derivative. A revised version of the Elzaki transform that is broader in scope and applicable over a wider range is developed, and some of its fundamental properties are given. This modified transform is performed to find solutions of certain non homogeneous linear $ \varrho $ Riemann–Liouville, $ \varrho $ Caputo fractional differential equations. Using comparision graphs, one can determine the effectiveness of the solutions. This research opens up new avenues for future research and has the potential to make a significant impact on the field of mathematics and its applications.