Person:
CANGÜL, İSMAİL NACİ

Profile Picture

Email Address

Birth Date

Research Projects

Organizational Units

OrgUnit Logo
Organizational Unit

Job Title

Last Name

CANGÜL

First Name

İSMAİL NACİ

Name

Filters

2016 - 201922020 - 202219
Reset filters

Settings

Search Results

Now showing 1 - 10 of 21
  • No Thumbnail Available
    Publication
    Distance eccentric connectivity index of graphs
    (Kyungpook Natl Univ, Dept Mathematics, 2021-03-01) Alqesmah, Akram; Saleh, Anwar; Rangarajan, R.; Gunes, Aysun Yurttas; Cangul, Ismail Naci; CANGÜL, İSMAİL NACİ; Bursa Uludağ Üniversitesi/Fen Edebiyat Fakültesi/Matematik Bölümü.; 0000-0001-6251-5518; 0000-0002-0700-5774; AAG-8470-2021; AGP-4352-2022; J-3505-2017; ACA-0773-2022
    Let G = (V, E) be a connected graph. The eccentric connectivity index of G is defined by xi(C) (G) = Sigma(u)(is an element of V)((G)) deg(u)e(u), where deg(u) and e(u) denote the degree and eccentricity of the vertex u in G, respectively. In this paper, we introduce a new formulation of xi(C) that will be called the distance eccentric connectivity index of G and defined byxi(De)(G) = Sigma(u is an element of V(G))deg(De)(u)e(u)where deg(De)(u) denotes the distance eccentricity degree of the vertex u in G. The aim of this paper is to introduce and study this new topological index. The values of the eccentric connectivity index is calculated for some fundamental graph classes and also for some graph operations. Some inequalities giving upper and lower bounds for this index are obtained.
  • No Thumbnail Available
    Publication
    Bounds for the sum of cubes of vertex degrees of splice graphs
    (Turkic World Mathematical, 2020-01-01) Lokesha, Veerebradiah; Jain, Sushmitha; Muddalapuram, Manjunath; Çevik, Ahmet Sinan; Cangül, İsmail Naci; CANGÜL, İSMAİL NACİ; Bursa Uludağ Üniversitesi/Fen-Edebiyat Fakültesi/Matematik Bölümü.; 0000-0002-0700-5774; ABA-6206-2020; J-3505-2017
    Some chemically interesting graphs can be derived from simpler graphs by some graph operations. One of the most relevant among these interesting graphs is named as splice graphs. They are related to RNA sequencing and therefore is of great interest. The main target of this paper is to obtain the explicit interpretation of F-index in terms of the graph size and maximum or minimum vertex degrees of special splice graphs.
  • No Thumbnail Available
    Publication
    Some graph parameters of power set graphs
    (Pushpa Publishing House, 2021-03-01) Nacaroğlu, Yaşar; Akgüneş, Nihat; Pak, Sedat; Cangül, İsmail Naci; CANGÜL, İSMAİL NACİ; Bursa Uludağ Üniversitesi/Fen-Edebiyat Fakültesi/Matematik Bölümü; J-3505-2017
    In this study, we examine some graph parameters such as the edge number, chromatic number, girth, domination number and clique number of power set graphs.
  • No Thumbnail Available
    Publication
    Encrypting and decrypting algorithms using strong face graph of a tree
    (Taylor & Francis Ltd, 2020-10-01) Kuppan, R.; Shobana, L.; Cangül, İsmail Naci; CANGÜL, İSMAİL NACİ; 0000-0002-6401-6533; 0000-0002-0700-5774; ABE-7781-2021; J-3505-2017
    The encryption and decryption is based upon the type of cryptographic scheme being employed and also in some form of key. It is most closely associated with the development and creation of the mathematical algorithms used to encrypt and decrypt messages. The combination of graph labelling techniques together with cryptography to encrypt and decrypt the numbers has been already an ongoing aspect of research. In this paper, the concept of face antimagic labelling is used for a strong face of duplication of all vertices by the edges of a tree to encrypt and decrypt 13 secret numbers.
  • Thumbnail Image
    Publication
    Effect of edge and vertex addition on albertson and bell indices
    (Amer Inst Mathematical Sciences-aims, 2021-01-01) Delen, Sadık; Cangül, İsmail Naci; Delen, Sadık; CANGÜL, İSMAİL NACİ; Bursa Uludağ Üniversitesi/Fen-Edebiyat Fakültesi/Matematik Bölümü; 0000-0002-0700-5774; J-3505-2017; EUU-3205-2022
    Topological graph indices have been of great interest in the research of several properties of chemical substances as it is possible to obtain these properties only by using mathematical calculations. The irregularity indices are the ones to determine the degree of irregularity of a graph. Albertson and Bell indices are two of them. Edge and vertex deletion and addition are important and useful methods in calculating several properties of a given graph. In this paper, the effects of adding a new edge or a new vertex to a graph on the Albertson and Bell indices are determined.
  • No Thumbnail Available
    Publication
    Computing the hosoya and the merrifield-simmons indices of two special benzenoid systems
    (Univ Kashan, Fac Mathematical Sciences, 2021-06-01) Öz, Mert Sinan; Cangül, İsmail Naci; CANGÜL, İSMAİL NACİ; Bursa Uludağ Üniversitesi/Fen-Edebiyat Fakültesi/Matematik Bölümü; J-3505-2017
    Gutman et al. gave some relations for computing the Hosoya indices of two special benzenoid systems R-n and P-n. In this paper, we compute the Hosoya index and Merrifield-Simmons index of R-n and P-n, by means of introducing four vectors for each benzenoid system and index. As a result, we compute the Hosoya index and the Merrifield-Simmons index of R-n and P-n, by means of a product of a certain matrix of degree n and a certain vector.
  • Thumbnail Image
    Publication
    Omega index of line and total graphs
    (Hindawi, 2021-09-09) Demirci, Musa; Delen, Sadık; Çevik, Ahmet Sinan; Cangül, İsmail Naci; DEMİRCİ, MUSA; Delen, Sadık; CANGÜL, İSMAİL NACİ; Bursa Uludağ Üniversitesi/Fen-Edebiyat Fakültesi/Matematik Bölümü.; 0000-0002-6439-8439; 0000-0003-4689-3660; 0000-0002-0700-5774; A-6557-2018; EUU-3205-2022 ; J-3505-2017
    A derived graph is a graph obtained from a given graph according to some predetermined rules. Two of the most frequently used derived graphs are the line graph and the total graph. Calculating some properties of a derived graph helps to calculate the same properties of the original graph. For this reason, the relations between a graph and its derived graphs are always welcomed. A recently introduced graph index which also acts as a graph invariant called omega is used to obtain such relations for line and total graphs. As an illustrative exercise, omega values and the number of faces of the line and total graphs of some frequently used graph classes are calculated.
  • Thumbnail Image
    Publication
    On omega index and average degree of graphs
    (Hindawi, 2021-11-12) Delen, Sadık; Demirci, Musa; Cevik, Ahmet Sinan; Cangül, İsmail Naci; Delen, Sadık; DEMİRCİ, MUSA; CANGÜL, İSMAİL NACİ; 0000-0002-0700-5774; 0000-0002-6439-8439; 0000-0003-4689-3660; A-6557-2018; J-3505-2017; EUU-3205-2022
    Average degree of a graph is defined to be a graph invariant equal to the arithmetic mean of all vertex degrees and has many applications, especially in determining the irregularity degrees of networks and social sciences. In this study, some properties of average degree have been studied. Effect of vertex deletion on this degree has been determined and a new proof of the handshaking lemma has been given. Using a recently defined graph index called omega index, average degree of trees, unicyclic, bicyclic, and tricyclic graphs have been given, and these have been generalized to k-cyclic graphs. Also, the effect of edge deletion has been calculated. The average degree of some derived graphs and some graph operations have been determined.
  • No Thumbnail Available
    Publication
    Independence number of graphs and line graphs of trees by means of omega invariant
    (Springer, 2020-02-26) Srivastava, Gautam; Srivastava, Hari Mohan; Ozden, Hacer; ÖZDEN AYNA, HACER; Zihni, Fikriye Ersoy; Erdogan, Fatma Ozen; ÖZEN ERDOĞAN, FATMA; Cangul, Ismail Naci; CANGÜL, İSMAİL NACİ; Bursa Uludağ Üniversitesi/Fen Edebiyat Fakültesi/Matematik Bölümü.; 0000-0002-0700-5774; 0000-0002-3991-0488; AAH-5090-2021; ABA-6206-2020; J-3505-2017; AAG-8274-2021
    A recently defined graph invariant denoted by O(G) for a graph G is shown to have several applications in graph theory. This number gives direct information on the realizability, number of realizations, connectedness, cyclicness, number of components, chords, loops, pendant edges, faces, bridges, etc. In this paper, we use O to give a characterization of connected unicyclic graphs, to calculate the omega invariant and to formalize the number of faces of the line graph of a tree, and give a new algorithm to formalize the independence number of graphs G and line graphs L(G) by means of the support vertices, pendant vertices and isolated vertices in G.
  • No Thumbnail Available
    Publication
    Sum-edge characteristic polynomials of graphs
    (Taylor & Francis, 2019-01-01) Öz, Mert Sinan; Cangül, İsmail Naci; CANGÜL, İSMAİL NACİ; Yamaç, Çilem; Bursa Uludağ Üniversitesi/Fen Edebiyat Fakültesi/Matematik Bölümü.; 0000-0002-0700-5774; ABA-6206-2020
    Modelling a chemical compound by a (molecular) graph helps us to obtain some required information about the chemical and physical properties of the corresponding molecular structure. Linear algebraic notions and methods are used to obtain several properties of graphs usually by the help of some graph matrices and these studies form an important sub area of Graph Theory called spectral graph theory. In this paper, we deal with the sum-edge matrices defined by means of vertex degrees. We calculate the sum-edge characteristic polynomials of several important graph classes by means of the corresponding sum-edge matrices.