Person:
YURTTAŞ GÜNEŞ, AYSUN

Profile Picture

Email Address

Birth Date

Research Projects

Organizational Units

OrgUnit Logo
Organizational Unit

Job Title

Last Name

YURTTAŞ GÜNEŞ

First Name

AYSUN

Name

Filters

20204
Reset filters

Settings

Search Results

Now showing 1 - 4 of 4
  • No Thumbnail Available
    Publication
    Inverse problem for bell index
    (Univ Nis, Fac Sci Math, 2020-01-01) Togan, Müge; Yurttaş, Aysun; YURTTAŞ GÜNEŞ, AYSUN; Şanlı, Utkum; Çelik, Feriha; Cangül, İsmail Naci; CANGÜL, İSMAİL NACİ; Bursa Uludağ Üniversitesi/Fen Edebiyat Fakültesi/Matematik Bölümü.; 0000-0001-5349-3978; 0000-0002-0700-5774; J-3505-2017; AAG-8470-2021
    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.
  • No Thumbnail Available
    Publication
    Harmonic index and zagreb indices of vertex-semitotal graphs
    (New York Business Global Llc, 2020-01-01) Günes, Aysun Yurttaş; YURTTAŞ GÜNEŞ, AYSUN; Togan, Muge; Demirci, Musa; DEMİRCİ, MUSA; Cangül, İsmail Naci; CANGÜL, İSMAİL NACİ; Bursa Uludağ Üniversitesi/Fen Edebiyat Fakültesi/Matematik Anabilim Dalı.; 0000-0001-5349-3978; 0000-0002-0700-5774; A-6557-2018; AAG-8470-2021; J-3505-2017
    Graph theory is one of the rising areas in mathematics due to its applications in many areas of science. Amongst several study areas in graph theory, spectral graph theory and topological descriptors are in front rows. These descriptors are widely used in QSPR/QSAR studies in mathematical chemistry. Vertex-semitotal graphs are one of the derived graph classes which are useful in calculating several physico-chemical properties of molecular structures by means of molecular graphs modelling the molecules. In this paper, several topological descriptors of vertex-semitotal graphs are calculated. Some new relations on these values are obtained by means of a recently defined graph invariant called omega invariant.
  • Thumbnail Image
    Publication
    The effect of edge and vertex deletion on omega invariant
    (Univ Belgrade, Fac Electrical Engineering, 2020-12-01) Delen, Sadık; Togan, Müge; Yurttaş, Aysun; Ana, Uğur; Cangül, İsmail Naci; Delen, Sadık; Togan, Müge; YURTTAŞ GÜNEŞ, AYSUN; Ana, Uğur; CANGÜL, İSMAİL NACİ; Bursa Uludağ Üniversitesi/Fen-Edebiyat Fakültesi/Matematik Bölümü; 0000-0001-5349-3978; 0000-0002-0700-5774; AAG-8470-2021; J-3505-2017; EUU-3205-2022; GBL-2333-2022; CBI-5098-2022
    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.
  • Thumbnail Image
    Publication
    Matching number and characteristic polynomial of a graph
    (Taylor & Francis, 2020-07-11) Yurttaş Güneş, Aysun; Demirci, Musa; Öz, Mert Sinan; Cangül, İsmail Naci; YURTTAŞ GÜNEŞ, AYSUN; DEMİRCİ, MUSA; CANGÜL, İSMAİL NACİ; Bursa Uludağ Üniversitesi/Fen-Edebiyat Fakültesi/Matematik Bölümü.; 0000-0002-0700-5774; 0000-0002-6439-8439; AAG-8470-2021; A-6557-2018; J-3505-2017
    Matching number and the spectral properties depending on the characteristic polynomial of a graph obtained by means of the adjacency polynomial has many interesting applications in different areas of science. There are some work giving the relation of these two areas. Here the relations between these two notions are considered and several general results giving this relations are obtained. A result given for only unicyclic graphs is generalized. There are some methods for determining the matching number of a graph in literature. Usually nullity, spanning trees and several graph parts are used to do this. Here, as a new method, the conditions for calculating the matching number of a graph by means of the coefficients of the characteristic polynomial of the graph are determined. Finally some results on the matching number of graphs are obtained.