Sum-edge characteristic polynomials of graphs
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 grap...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Taylor & Francis Group
2019-12-01
|
Series: | Journal of Taibah University for Science |
Subjects: | |
Online Access: | http://dx.doi.org/10.1080/16583655.2018.1555989 |
_version_ | 1819076958020960256 |
---|---|
author | Mert Sinan Oz Cilem Yamac Ismail Naci Cangul |
author_facet | Mert Sinan Oz Cilem Yamac Ismail Naci Cangul |
author_sort | Mert Sinan Oz |
collection | DOAJ |
description | 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. |
first_indexed | 2024-12-21T18:49:34Z |
format | Article |
id | doaj.art-cd181b801f7f48509d3a4b0631b34eaa |
institution | Directory Open Access Journal |
issn | 1658-3655 |
language | English |
last_indexed | 2024-12-21T18:49:34Z |
publishDate | 2019-12-01 |
publisher | Taylor & Francis Group |
record_format | Article |
series | Journal of Taibah University for Science |
spelling | doaj.art-cd181b801f7f48509d3a4b0631b34eaa2022-12-21T18:53:47ZengTaylor & Francis GroupJournal of Taibah University for Science1658-36552019-12-0113119320010.1080/16583655.2018.15559891555989Sum-edge characteristic polynomials of graphsMert Sinan Oz0Cilem Yamac1Ismail Naci Cangul2Bursa Technical UniversityUludag UniversityUludag UniversityModelling 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.http://dx.doi.org/10.1080/16583655.2018.1555989graphsadjacencysum-edge characteristic polynomial |
spellingShingle | Mert Sinan Oz Cilem Yamac Ismail Naci Cangul Sum-edge characteristic polynomials of graphs Journal of Taibah University for Science graphs adjacency sum-edge characteristic polynomial |
title | Sum-edge characteristic polynomials of graphs |
title_full | Sum-edge characteristic polynomials of graphs |
title_fullStr | Sum-edge characteristic polynomials of graphs |
title_full_unstemmed | Sum-edge characteristic polynomials of graphs |
title_short | Sum-edge characteristic polynomials of graphs |
title_sort | sum edge characteristic polynomials of graphs |
topic | graphs adjacency sum-edge characteristic polynomial |
url | http://dx.doi.org/10.1080/16583655.2018.1555989 |
work_keys_str_mv | AT mertsinanoz sumedgecharacteristicpolynomialsofgraphs AT cilemyamac sumedgecharacteristicpolynomialsofgraphs AT ismailnacicangul sumedgecharacteristicpolynomialsofgraphs |