Wiener Polynomials for Multi-Rings Paraffin Structures
The distance between any two vertices u and v in a connected graph G is defined as the length of the shortest path between them, and it is denoted by d(u,v).The sum of distances for all unordered pairs of distinct vertices in G represents Wiener index. The number of pairs of vertices G which are dis...
Main Author: | |
---|---|
Format: | Article |
Language: | Arabic |
Published: |
Mosul University
2007-12-01
|
Series: | Al-Rafidain Journal of Computer Sciences and Mathematics |
Subjects: | |
Online Access: | https://csmj.mosuljournals.com/article_164025_a6fddb510d4d5d345f8380a402a5ae3b.pdf |