Browsing by Author "Ediz, S."

Now showing 1 - 11 of 11

Analyzing the Boron Triangular Nanotube Through Topological Indices Via M-Polynomial
(Taylor and Francis Ltd., 2021) Hussain, S.; Afzal, F.; Afzal, D.; Cancan, M.; Ediz, S.; Farahani, M.R.
he current discovery of different types of nanostructures has inspired the researcher to study the applications of these structures in different fields. In this study, we have analyzed the boron triangular nanotube through topological indices. M-polynomial of a boron triangular nanotube has the capability to recover the topological indices which are dependent on the degree of the vertex. We have presented the results in graphical form. © 2021 Taru Publications.
The Augmented Eccentric Connectivity Index of an Infinite Class of Nanostar Dendrimers
(Natl inst Optoelectronics, 2010) Ediz, S.
Let G be a molecular graph, the augmented eccentric connectivity index is a topological index was defined as (A)xi(c)(G)=(n)Sigma(i=1)(M(i)/E(i)) where M(i) is the product of degrees of all vertices v(j), adjacent to vertex v(i), E(i) is the largest distance between v(i) and any other vertex v(k) of G or the eccentricity of v(i) and n is the number of vertices in graph G. In this paper an exact formula for the augmented eccentric connectivity index of an infinite class of nanostar dendrimers is given.
Computing Ediz Eccentric Connectivity Index of an Infinite Class of Nanostar Dendrimers
(Natl inst Optoelectronics, 2010) Ediz, S.
Let G be a molecular graph, we firstly define Ediz eccentric connectivity index as (E)xi(c) (G) = Sigma(n)(i=1) (S(i)/E(i)) where S(i) is the sum of degrees of all vertices v(j), adjacent to vertex v(i), E(i). is the largest distance between v(i) and any other vertex v(k) of G or the eccentricity of v(i) and n is the number of vertices in graph G. In this paper an exact formula for the Ediz eccentric connectivity index of an infinite class of nanostar dendrimers is given.
Computing Ga4 Index of an Infinite Class of Nanostar Dendrimers
(Natl inst Optoelectronics, 2010) Ediz, S.
Let G be a connected graph, the GA index (Geometric-Arithmetic index) is a topological index was defined as GA(G)= Sigma(uv is an element of(G))root d(u)d(v)/1/2(d(u)+d(v)) where d(u) denotes degree of u. Now we define a new version of GA index as GA(4)(G)= Sigma(uv is an element of E(G))root epsilon(u)epsilon(v)/1/2(epsilon(u)+epsilon(v)) where epsilon(v) is the largest distance between v and any other vertex u of G or the eccentricity of v. In this paper an exact formula for the GA(4) index of an infinite class of nanostar dendrimers is given.
M-Polynomial and Topological Indices of Benzene Ring Embedded in P-Type Surface Network
(Universidad Catolica del Norte, 2020) Cancan, M.; Ediz, S.; Baig, A.Q.; Khalid, W.
The representation of chemical compounds and chemical networks with the M-polynomials is a new idea and it gives nice and good results of the topological indices. These results are used to correlate the chemical compounds and chemical networks with their chemical properties and bioactivities. Particular attention is paid to the derivation of the M polynomia-for the benzene ring embedded in the P-type surface network in 2D. Furthermore, the topological indices based on the degrees are also derived by using the general form of M-polynomial of benzene ring embedded in the P-type surface network BR(m, n). In the end, the graphical representation and comparison of the M-polynomial and the topological indices of benzene ring embedded in P-type surface network in 2D are described. © 2020 Murat Cancan, Siileyman Ediz, Abdul Qudair Baig, and Waqas Khalid.
Maximal Graphs of the First Reverse Zagreb Beta Index
(Turkic World Mathematical Soc, 2018) Ediz, S.
The reverse vertex degree of a vertex v of a simple connected graph G defined as; c(v) = Delta - d(v) + 1 where Delta denotes the largest of all degrees of vertices of G and d(v) denotes the number of edges incident to v. The first reverse Zagreb beta index of a simple connected graph G defined as; CM1 beta (G) = Sigma(uv is an element of E(G)) (c(u) + c(v)). In this paper we characterized maximal graphs with respect to the first reverse Zagreb beta index.
Maximum Chemical Trees of the Second Reverse Zagreb Index
(Nova Science Publishers, Inc., 2016) Ediz, S.
The reverse vertex degree of a vertex v of a simple connected graph G defined as; cv =δ-dv + 1 where δ denotes the largest of all degrees of vertices of G and dv denotes the number of edges incident to v. The second reverse Zagreb index of a simple connected graph G defined as; CM2 (G) = σuv2E(G) cucv. In this paper we characterized maximum chemical trees with respect to the second reverse Zagreb index. © 2017 by Nova Science Publishers, Inc. All rights reserved.
On Ev-Degree and Ve-Degree Topological Indices
(Univ Kashan, Fac Mathematical Sciences, 2018) Sahin, B.; Ediz, S.
Recently two new degree concepts have been defined in graph theory: ev-degree and ve-degree. Also the ev-degree and ve-degree Zagreb and Randie indices have been defined very recently as parallel of the classical definitions of Zagreb and Randie indices. It was shown that ev-degree and ve-degree topological indices can be used as possible tools in QSPR researches [2]. In this paper, we define the ve-degree and ev-degree Narumi-Katayama indices, investigate the predicting power of these novel indices and extremal graphs with respect to these novel topological indices. Also we give some basic mathematical properties of ev-degree and ve-degree Narumi-Katayama and Zagreb indices. (C) 2018 University of Kashan Press. All rights reserved
On Stratification and Domination in Prisms
(2011) Ediz, S.
A graph G is 2-stratified if its vertex set partitioned into two color classes. We color the vertices in one color class red and the other class blue. Let F be a 2-stratified graph with one fixed blue vertex v specified. We say that F is rooted at v. The F-domination number of a graph G is the minimum number of red vertices of G in a red- blue coloring of the vertices of G such that every blue vertex v of G belongs to a copy of F rooted at v. In this paper we investigate the F- domination number of prisms when F is 2-stratified 6-cycle rooted at a blue vertex. And we get a new generalization result of stratified domination number for prisms.
On the Chemical Characteristics of Fullerenes as Modelled by R Index
(World Scientific, 2023) Aldemir, M.S.; Ediz, S.
A fundamental allotrope of carbon that has drawn significant interest in the fields of nanoscience, nanotechnology, condensed matter physics and chemistry, biological physics, materials science and technology, mechanical and electrical sciences, biomedical engineering, and most recently, medical nanotechnology, and nanoneuroscience. Fullerenes are another important allotrope of carbon in addition to graphite, diamond, and nanotubes. The use of molecular topological indices is crucial for bridging the gap between theoretical and practical aspects of chemical characteristics. In recent years, topological indices have been used to investigate the chemical and physical characteristics of fullerenes. This paper uses the R molecular topological index to present topological modeling of the binding energies, heats of formation, shape resonances, and Ramsauer-Townsend minima of fullerenes. © 2023 World Scientific Publishing Europe Ltd.
Some Resistance Distance and Distance-Based Graph Invariants and Number of Spanning Trees in the Tensor Product of Pz and Kn
(Universidad Catolica del Norte, 2020) Sardar, M.S.; Cancan, M.; Ediz, S.; Sajjad, W.
The resistance distance (Kirchhoff index and multiplicative Kirchhoff index) and distance-based (Wiener index and Gutman index) graph invariants of Γn = p2 x Kn are considered. Firstly by using the decomposition theorem, we procure the Laplacian and Normalized Laplacian spectrum for graph r n, respectively. Based on which, we can procured the formulae for the number of spanning trees and some resistance distance and distancebased graph invariants of graph Γn. Also, it is very interesting to see that when n tends to infinity, Kf (Γn) is a polynomial and W (Γn) is a quadratic polynomial. © 2020 Muhammad Shoaib Sardar, Murat Cancan, SUleyman Ediz and Wasim Sajjad.