Weiner Polynomials for Generalization of Distance for Some Special Graphs | ||
| AL-Rafidain Journal of Computer Sciences and Mathematics | ||
| Article 15, Volume 3, Issue 2, December 2006, Pages 103-120 PDF (513.38 K) | ||
| Document Type: Research Paper | ||
| DOI: 10.33899/csmj.2006.164061 | ||
| Authors | ||
| Ali Aziz Ali1; Ahmed M. Ali2 | ||
| 1Academic Professor University of Mosul, Mosul, Iraq | ||
| 2College of Computer Sciences and Mathematics University of Mosul, Mosul, Iraq | ||
| Abstract | ||
| The minimum distance of a vertex v to an set of vertices of a graph G is defined as : . The n-Wiener polynomial for this distance of a graph G is defined as , where is the number of order pairs (v,S), , such that , and is the diameter for this minimum n-distance. In this paper, the n-Wiener polynomials for some types of graphs such as complete graphs, bipartite graphs, star graphs, wheel graphs, path and cycle graphs are obtained .The n-Wiener index for each of these special graphs is given. Moreover, some properties of the coefficients of are established. | ||
| Keywords | ||
| n-distance; Wiener polynomial; Special graphs | ||
|
Statistics Article View: 209 PDF Download: 251 |
||