Esra Öztürk Sözen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Esra Öztürk Sözen has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Elif Eryaşar
Department of Mathematics, Sinop University, Sinop, Türkiye
13 shared publications - Cihat Abdioğlu
Department of Mathematics and Science Education, Faculty of Education, Karamanoğlu Mehmetbey University, Karaman, Turkey
3 shared publications - Shakir Ali
Department of Mathematics , Aligarh Muslim University , Aligarh - 202002 , India
2 shared publications - Amal S. Alali
Princess Nourah Bint Abdulrahman University
1 shared publication - Burcu Nişancı Türkmen
Amasya Üniversitesi
1 shared publication Elif Eryaşar
Sinop University: Sinop Universitesi
1 shared publication
Latest Publications
- 4 November 2026
- Published by Springer Nature in Soft Computing
- p. 1-23
Zagreb Indices and Adjacency Matrices of Fuzzy Zero Divisor Graphs with MATLAB Based Algebraic Applications
- 4 November 2026
- Published by Springer Nature in Soft Computing
- p. 1-23
Zagreb Indices and Adjacency Matrices of Fuzzy Zero Divisor Graphs with MATLAB Based Algebraic Applications
- 26 August 2026
- Published by University Library in Kragujevac in Match Communications in Mathematical and in Computer Chemistry
- Vol. 97 (2) , 737
Euler Hyperbolic Sombor Index
In this paper, we introduce the Euler hyperbolic Sombor index and investigate its fundamental properties across various classes of graphs. We first establish general lower and upper bounds for this index and examine its relationships with several well-known topological indices, including the Euler Sombor index, the geometric-arithmetic index, the first Zagreb index, and the hyperbolic Sombor index. Furthermore, explicit formulas and extremal results are obtained for particular graph classes such as paths, cycles, stars, complete graphs, and trees, and the corresponding equality cases are characterized. In the application part, we present general combinatorial formulas for computing this index for benzenoid systems and phenylenes.
- 26 August 2026
- Published by University Library in Kragujevac in Match Communications in Mathematical and in Computer Chemistry
- Vol. 97 (2) , 737
Euler Hyperbolic Sombor Index
In this paper, we introduce the Euler hyperbolic Sombor index and investigate its fundamental properties across various classes of graphs. We first establish general lower and upper bounds for this index and examine its relationships with several well-known topological indices, including the Euler Sombor index, the geometric-arithmetic index, the first Zagreb index, and the hyperbolic Sombor index. Furthermore, explicit formulas and extremal results are obtained for particular graph classes such as paths, cycles, stars, complete graphs, and trees, and the corresponding equality cases are characterized. In the application part, we present general combinatorial formulas for computing this index for benzenoid systems and phenylenes.
- 10 March 2025
- Published by Institute of Mathematics, Czech Academy of Sciences
- Vol. 151 (2) , 249-272
On module classes of generalized semiperfect modules
Institute of Mathematics of the Czech Academy of Sciences
- 10 March 2025
- Published by Institute of Mathematics, Czech Academy of Sciences
- Vol. 151 (2) , 249-272
On module classes of generalized semiperfect modules
Institute of Mathematics of the Czech Academy of Sciences
- Open Access
- 1 January 2025
- Published by National Library of Serbia in Filomat
- Vol. 39 (22) , 7707-7719
Characterization of ss-supplemented modules with respect to finitely generated factor modules in view of singularity
In this essay (amply) cofinitely ?ss-supplemented modules are presented and fundamental algebraic features of these modules are examined. Privately, a ring characterization theorem is presented as follows. R is a ?ss-perfect ring if and only if every (projective) left R-module is (amply) cofinitely ?ss-supplemented. Moreover, the question when cofinitely ?ss-supplemented modules are cofinitely ss-supplemented is checked. With this aim we define left ?ss-rings and the fact that a ring R is a left ?ss-ring if and only if each cofinitely ?ss-supplemented R-module is cofinitely ss-supplemented is proven.
- 1 January 2025
- Published by National Library of Serbia in Filomat
- Vol. 39 (22) , 7707-7719
Open AccessCharacterization of ss-supplemented modules with respect to finitely generated factor modules in view of singularity
In this essay (amply) cofinitely ?ss-supplemented modules are presented and fundamental algebraic features of these modules are examined. Privately, a ring characterization theorem is presented as follows. R is a ?ss-perfect ring if and only if every (projective) left R-module is (amply) cofinitely ?ss-supplemented. Moreover, the question when cofinitely ?ss-supplemented modules are cofinitely ss-supplemented is checked. With this aim we define left ?ss-rings and the fact that a ring R is a left ?ss-ring if and only if each cofinitely ?ss-supplemented R-module is cofinitely ss-supplemented is proven.
- Open Access
- 1 January 2025
- Published by National Library of Serbia in Filomat
- Vol. 39 (14) , 4873-4886
Fuzzy F-index of fuzzy zero divisor graphs with MATLAB based algebraic applications
This article aims to explore the theoretical properties of topological descriptors used in fuzzy graph theory, which combines elements of graph theory and fuzzy set theory, within algebraic structures. For this purpose, fuzzy F-index (briefly F F-index) has been formulated theoretically for the fuzzy zero divisor graphs of the commutative ringn Z, where n = ??,?1?2, ?21 ?2, ?21 ?22, ?1 ?2 ?3 (?1, ?2, ?3 are primes and ? ? 3). In particular, a SageMath-based drawing algorithm that embodies the fuzzy graph structures of the rings is presented for application based convenience. Furthermore, a MATLbased code was created that directly calculate the fuzzy F-index of the fuzzy zero divisor graphs for every non-prime value of n > 1.
- 1 January 2025
- Published by National Library of Serbia in Filomat
- Vol. 39 (14) , 4873-4886
Open AccessFuzzy F-index of fuzzy zero divisor graphs with MATLAB based algebraic applications
This article aims to explore the theoretical properties of topological descriptors used in fuzzy graph theory, which combines elements of graph theory and fuzzy set theory, within algebraic structures. For this purpose, fuzzy F-index (briefly F F-index) has been formulated theoretically for the fuzzy zero divisor graphs of the commutative ringn Z, where n = ??,?1?2, ?21 ?2, ?21 ?22, ?1 ?2 ?3 (?1, ?2, ?3 are primes and ? ? 3). In particular, a SageMath-based drawing algorithm that embodies the fuzzy graph structures of the rings is presented for application based convenience. Furthermore, a MATLbased code was created that directly calculate the fuzzy F-index of the fuzzy zero divisor graphs for every non-prime value of n > 1.
- Open Access
- 11 December 2024
- Published by Springer Nature in Research Square
Zagreb Indices and Adjacency Matrices of Fuzzy Zero Divisor Graphs with MATLAB Based Algebraic Applications
This article aims to explore the theoretical properties of topological descriptors used in fuzzy graph theory, which combines elements of graph theory and fuzzy set theory, within algebraic structures. For this purpose, fuzzy Zagreb topological indices have been formulated theoretically and also adjacency matrices are constructed for the fuzzy zero-divisor graphs of the commutative ring Zn where n=pα , n=p1 p2 (p1 and p2 are primes). In particular, a SageMath-based drawing algorithm that embodies the fuzzy graph structures of the rings is presented for application-based convenience. Furthermore, a MATLAB-based code was created that directly calculates the Zagreb indices and adjacency matrices of the fuzzy zero-divisor graphs for every conceivable value of $n$. And thanks to this code, applications are included where we can calculate the characteristic polynomials, eigenvalues and graph energies of the fuzzy algebraic graphs we are working on. AMS Classification: 05C25, 05C72, 05C09- 11 December 2024
- Published by Springer Nature in Research Square
Open AccessZagreb Indices and Adjacency Matrices of Fuzzy Zero Divisor Graphs with MATLAB Based Algebraic Applications
This article aims to explore the theoretical properties of topological descriptors used in fuzzy graph theory, which combines elements of graph theory and fuzzy set theory, within algebraic structures. For this purpose, fuzzy Zagreb topological indices have been formulated theoretically and also adjacency matrices are constructed for the fuzzy zero-divisor graphs of the commutative ring Zn where n=pα , n=p1 p2 (p1 and p2 are primes). In particular, a SageMath-based drawing algorithm that embodies the fuzzy graph structures of the rings is presented for application-based convenience. Furthermore, a MATLAB-based code was created that directly calculates the Zagreb indices and adjacency matrices of the fuzzy zero-divisor graphs for every conceivable value of $n$. And thanks to this code, applications are included where we can calculate the characteristic polynomials, eigenvalues and graph energies of the fuzzy algebraic graphs we are working on. AMS Classification: 05C25, 05C72, 05C09 - Open Access
- 18 June 2024
- Published by Karadeniz Fen Bilimleri Dergisi in Karadeniz Fen Bilimleri Dergisi
- Vol. 14 (2) , 468-475
New Formulas and New Bounds for the First and Second Zagreb Indices of Phenylenes
Graph theory is widely used to represent and analyze chemical structures. In addition, topological indices developed for graphs have a connection with the relationships of chemical structures such as physicochemical and bioactivity. Topological indices are widely used in QSPR-QSAR analysis and have found many applications in chemical graph theory. The oldest known degree-dependent topological indices are the first and second Zagreb indices. These indices have found wide application in chemical structures. Phenylenes containing aromatic and antiaromatic rings exhibit unique physicochemical properties and there is a wide variety of studies on phenylenes. In this article, we present some new formulas and lower bounds for the first and second Zagreb indices molecular structures of phenylenes. In addition, the BFS algorithm method, which is one of the graph algorithms, was used for the first time for the boundary study of chemical structures.
- 18 June 2024
- Published by Karadeniz Fen Bilimleri Dergisi in Karadeniz Fen Bilimleri Dergisi
- Vol. 14 (2) , 468-475
Open AccessNew Formulas and New Bounds for the First and Second Zagreb Indices of Phenylenes
Graph theory is widely used to represent and analyze chemical structures. In addition, topological indices developed for graphs have a connection with the relationships of chemical structures such as physicochemical and bioactivity. Topological indices are widely used in QSPR-QSAR analysis and have found many applications in chemical graph theory. The oldest known degree-dependent topological indices are the first and second Zagreb indices. These indices have found wide application in chemical structures. Phenylenes containing aromatic and antiaromatic rings exhibit unique physicochemical properties and there is a wide variety of studies on phenylenes. In this article, we present some new formulas and lower bounds for the first and second Zagreb indices molecular structures of phenylenes. In addition, the BFS algorithm method, which is one of the graph algorithms, was used for the first time for the boundary study of chemical structures.
- 1 May 2024
- Published by Bentham Science Publishers Ltd. in Current Organic Synthesis
- Vol. 21 (3) , 239-245
Forgotten Topological and Wiener Indices of Prime Ideal Sum Graph of ℤn
Background: Chemical graph theory is a sub-branch of mathematical chemistry, assuming each atom of a molecule is a vertex and each bond between atoms as an edge. Objective: Owing to this theory, it is possible to avoid the difficulties of chemical analysis because many of the chemical properties of molecules can be determined and analyzed via topological indices. Due to these parameters, it is possible to determine the physicochemical properties, biological activities, environmental behaviours and spectral properties of molecules. Nowadays, studies on the zero divisor graph of Z_n via topological indices is a trending field in spectral graph theory. Methods: For a commutative ring R with identity, the prime ideal sum graph of R is a graph whose vertices are nonzero proper ideals of R and two distinctvertices I and J are adjacent if and only if I+J is a prime ideal of R. Results: In this study the forgotten topological index and Wiener index of the prime ideal sum graph of Z_n are calculated for n=p^α,pq,p^2 q,p^2 q^2,pqr,p^3 q,p^2 qr,pqrs where p,q,r and s are distinct primes and a Sage math code is developed for designing graph and computing the indices. Conclusion: In the light of this study, it is possible to handle the other topological descriptors for computing and developing new algorithms for next studies and to study some spectrum and graph energies of certain finite rings with respect to PIS-graph easily.
- 1 May 2024
- Published by Bentham Science Publishers Ltd. in Current Organic Synthesis
- Vol. 21 (3) , 239-245
Forgotten Topological and Wiener Indices of Prime Ideal Sum Graph of ℤn
Background: Chemical graph theory is a sub-branch of mathematical chemistry, assuming each atom of a molecule is a vertex and each bond between atoms as an edge. Objective: Owing to this theory, it is possible to avoid the difficulties of chemical analysis because many of the chemical properties of molecules can be determined and analyzed via topological indices. Due to these parameters, it is possible to determine the physicochemical properties, biological activities, environmental behaviours and spectral properties of molecules. Nowadays, studies on the zero divisor graph of Z_n via topological indices is a trending field in spectral graph theory. Methods: For a commutative ring R with identity, the prime ideal sum graph of R is a graph whose vertices are nonzero proper ideals of R and two distinctvertices I and J are adjacent if and only if I+J is a prime ideal of R. Results: In this study the forgotten topological index and Wiener index of the prime ideal sum graph of Z_n are calculated for n=p^α,pq,p^2 q,p^2 q^2,pqr,p^3 q,p^2 qr,pqrs where p,q,r and s are distinct primes and a Sage math code is developed for designing graph and computing the indices. Conclusion: In the light of this study, it is possible to handle the other topological descriptors for computing and developing new algorithms for next studies and to study some spectrum and graph energies of certain finite rings with respect to PIS-graph easily.
- Open Access
- 29 January 2024
- Published by Sinop Universitesi Fen Bilimleri Dergisi in Sinop Üniversitesi Fen Bilimleri Dergisi
Bounds For Spectral Radius and Energy of $PIS$ GraphsOnce the spectral radius and energy of a graph structure have been defined, many properties have been studied. The spectral radius and energy of a graph are related to the eigenvalues of the adjacency matrix of the graph. In this paper, we define an adjacency matrix for a prime ideal sum ($PIS$) graph and then extend the concepts of spectral radius and energy to $PIS$ graphs. Some bound theorems on the energy and spectral radius of $PIS$ graph structures are given. A SageMath code for plotting these graphs is also provided.- 29 January 2024
- Published by Sinop Universitesi Fen Bilimleri Dergisi in Sinop Üniversitesi Fen Bilimleri Dergisi
Open AccessBounds For Spectral Radius and Energy of $PIS$ GraphsOnce the spectral radius and energy of a graph structure have been defined, many properties have been studied. The spectral radius and energy of a graph are related to the eigenvalues of the adjacency matrix of the graph. In this paper, we define an adjacency matrix for a prime ideal sum ($PIS$) graph and then extend the concepts of spectral radius and energy to $PIS$ graphs. Some bound theorems on the energy and spectral radius of $PIS$ graph structures are given. A SageMath code for plotting these graphs is also provided.