w-Wiener Polynomials for Width Distance of Some Special Graphs
Let G be a k<sub>0</sub>-connected graph ,and let ,,be the w- width, distance between the two vertices u,v in G. The w-Wiener polynomial of the width distance of G is defined by: W<sub>w</sub>(G;x) is obtained in this paper for some special graphs G suc...
| Main Authors: | , |
|---|---|
| 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_164030_d2c9dfe170ee516b4c3ce58e4af7f17e.pdf |
| _version_ | 1819027826721947648 |
|---|---|
| author | Ali Ali Asma Aziz |
| author_facet | Ali Ali Asma Aziz |
| author_sort | Ali Ali |
| collection | DOAJ |
| description | Let G be a k<sub>0</sub>-connected graph ,and let ,,be the w- width, distance between the two vertices u,v in G. The w-Wiener polynomial of the width distance of G is defined by:
W<sub>w</sub>(G;x) is obtained in this paper for some special graphs G such as a cycle , a wheel, a theta graph , a straight hexagonal chain , and Wagner graph .The diameter with respect to the width distance – w, and the Wiener index for each such special graphs are also obtained in this paper. |
| first_indexed | 2024-12-21T05:48:39Z |
| format | Article |
| id | doaj.art-61aaa7404ea54ce4ba6e84f3950261f2 |
| institution | Directory Open Access Journal |
| issn | 1815-4816 2311-7990 |
| language | Arabic |
| last_indexed | 2024-12-21T05:48:39Z |
| publishDate | 2007-12-01 |
| publisher | Mosul University |
| record_format | Article |
| series | Al-Rafidain Journal of Computer Sciences and Mathematics |
| spelling | doaj.art-61aaa7404ea54ce4ba6e84f3950261f22022-12-21T19:14:03ZaraMosul UniversityAl-Rafidain Journal of Computer Sciences and Mathematics1815-48162311-79902007-12-014210312410.33899/csmj.2007.164030164030w-Wiener Polynomials for Width Distance of Some Special GraphsAli Ali0Asma Aziz1College of Computer Science and Mathematics University of Mosul, IraqCollege of Computer Science and Mathematics University of Mosul, IraqLet G be a k<sub>0</sub>-connected graph ,and let ,,be the w- width, distance between the two vertices u,v in G. The w-Wiener polynomial of the width distance of G is defined by: W<sub>w</sub>(G;x) is obtained in this paper for some special graphs G such as a cycle , a wheel, a theta graph , a straight hexagonal chain , and Wagner graph .The diameter with respect to the width distance – w, and the Wiener index for each such special graphs are also obtained in this paper.https://csmj.mosuljournals.com/article_164030_d2c9dfe170ee516b4c3ce58e4af7f17e.pdfwiener polynomialwidth distancediameterwiener index |
| spellingShingle | Ali Ali Asma Aziz w-Wiener Polynomials for Width Distance of Some Special Graphs Al-Rafidain Journal of Computer Sciences and Mathematics wiener polynomial width distance diameter wiener index |
| title | w-Wiener Polynomials for Width Distance of Some Special Graphs |
| title_full | w-Wiener Polynomials for Width Distance of Some Special Graphs |
| title_fullStr | w-Wiener Polynomials for Width Distance of Some Special Graphs |
| title_full_unstemmed | w-Wiener Polynomials for Width Distance of Some Special Graphs |
| title_short | w-Wiener Polynomials for Width Distance of Some Special Graphs |
| title_sort | w wiener polynomials for width distance of some special graphs |
| topic | wiener polynomial width distance diameter wiener index |
| url | https://csmj.mosuljournals.com/article_164030_d2c9dfe170ee516b4c3ce58e4af7f17e.pdf |
| work_keys_str_mv | AT aliali wwienerpolynomialsforwidthdistanceofsomespecialgraphs AT asmaaziz wwienerpolynomialsforwidthdistanceofsomespecialgraphs |