Schultz and Modified Schultz Polynomials for Edge – Identification Chain and Ring – for Square Graphs

In a connected graph , the distance function between each pair of two vertices from a set vertex  is the shortest distance between them and the vertex degree  denoted by  is the number of edges which are incident to the vertex  The Schultz and modified Schultz polynomials of  are have defined as:...

Full description

Bibliographic Details
Main Authors: Ahmed Mohammed ali, Mahmood Madian Abdullah
Format: Article
Language:Arabic
Published: College of Science for Women, University of Baghdad 2022-06-01
Series:Baghdad Science Journal
Online Access:https://bsj.uobaghdad.edu.iq/index.php/BSJ/article/view/5110
_version_ 1818240296697200640
author Ahmed Mohammed ali
Mahmood Madian Abdullah
author_facet Ahmed Mohammed ali
Mahmood Madian Abdullah
author_sort Ahmed Mohammed ali
collection DOAJ
description In a connected graph , the distance function between each pair of two vertices from a set vertex  is the shortest distance between them and the vertex degree  denoted by  is the number of edges which are incident to the vertex  The Schultz and modified Schultz polynomials of  are have defined as:  respectively, where the summations are taken over all unordered pairs of distinct vertices in  and  is the distance between  and  in  The general forms of Schultz and modified Schultz polynomials shall be found and indices of the edge – identification chain and ring – square graphs in the present work.
first_indexed 2024-12-12T13:11:11Z
format Article
id doaj.art-bba3a4c07f1e4536be280dd35136bc5d
institution Directory Open Access Journal
issn 2078-8665
2411-7986
language Arabic
last_indexed 2024-12-12T13:11:11Z
publishDate 2022-06-01
publisher College of Science for Women, University of Baghdad
record_format Article
series Baghdad Science Journal
spelling doaj.art-bba3a4c07f1e4536be280dd35136bc5d2022-12-22T00:23:32ZaraCollege of Science for Women, University of BaghdadBaghdad Science Journal2078-86652411-79862022-06-0119310.21123/bsj.2022.19.3.0560Schultz and Modified Schultz Polynomials for Edge – Identification Chain and Ring – for Square GraphsAhmed Mohammed ali0Mahmood Madian Abdullah1Department of Mathematics, College of Computer Sciences and Mathematics, University of Mosul, Mosul, Iraq.Department of Mathematics, College of Computer Sciences and Mathematics, University of Mosul, Mosul, Iraq. In a connected graph , the distance function between each pair of two vertices from a set vertex  is the shortest distance between them and the vertex degree  denoted by  is the number of edges which are incident to the vertex  The Schultz and modified Schultz polynomials of  are have defined as:  respectively, where the summations are taken over all unordered pairs of distinct vertices in  and  is the distance between  and  in  The general forms of Schultz and modified Schultz polynomials shall be found and indices of the edge – identification chain and ring – square graphs in the present work. https://bsj.uobaghdad.edu.iq/index.php/BSJ/article/view/5110
spellingShingle Ahmed Mohammed ali
Mahmood Madian Abdullah
Schultz and Modified Schultz Polynomials for Edge – Identification Chain and Ring – for Square Graphs
Baghdad Science Journal
title Schultz and Modified Schultz Polynomials for Edge – Identification Chain and Ring – for Square Graphs
title_full Schultz and Modified Schultz Polynomials for Edge – Identification Chain and Ring – for Square Graphs
title_fullStr Schultz and Modified Schultz Polynomials for Edge – Identification Chain and Ring – for Square Graphs
title_full_unstemmed Schultz and Modified Schultz Polynomials for Edge – Identification Chain and Ring – for Square Graphs
title_short Schultz and Modified Schultz Polynomials for Edge – Identification Chain and Ring – for Square Graphs
title_sort schultz and modified schultz polynomials for edge identification chain and ring for square graphs
url https://bsj.uobaghdad.edu.iq/index.php/BSJ/article/view/5110
work_keys_str_mv AT ahmedmohammedali schultzandmodifiedschultzpolynomialsforedgeidentificationchainandringforsquaregraphs
AT mahmoodmadianabdullah schultzandmodifiedschultzpolynomialsforedgeidentificationchainandringforsquaregraphs