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:...
| Main Authors: | , |
|---|---|
| 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 |
| Summary: | 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.
|
|---|---|
| ISSN: | 2078-8665 2411-7986 |