Asset Details
Do you wish to reserve the book?
Schultz and Modified Schultz Polynomials for Edge – Identification Chain and Ring – for Pentagon and Hexagon Graphs
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Schultz and Modified Schultz Polynomials for Edge – Identification Chain and Ring – for Pentagon and Hexagon Graphs
Do you wish to request the book?
Schultz and Modified Schultz Polynomials for Edge – Identification Chain and Ring – for Pentagon and Hexagon Graphs
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
Schultz and Modified Schultz Polynomials for Edge – Identification Chain and Ring – for Pentagon and Hexagon Graphs
2021
Overview
In a connected graph G, the distance function between each pair of two vertices from a set vertex V ( G ) is a shortest distance between them and the vertex degree v , deg v , is the number of edges which are incident to the vertex v. The Schultz and modified Schultz polynomials of G are have defined as : Sc ( G ; x ) = ∑( deg v + deg u ) x d ( u , v ) and Sc ∗ ( G ; x ) = ∑ ( deg v . deg u ) x d ( u , v ), respectively, where the summations are taken over all unordered pairs of distinct vertices in V ( G ) and d ( u , v ) is the distance between u and v in V ( G ). We shall find the general forms of Schultz and modified Schultz polynomials and indices of the edge – identification chain and ring – pentagon and hexagon graphs in the present work.
Publisher
IOP Publishing
Subject
