Weiner Polynomials for Generalization of Distance for Some Special Graphs
The minimum distance of a vertex v to an set of vertices of a graph G is defined as :<br /> .<br /> The n-Wiener polynomial for this distance of a graph G is defined as<br /> ,<br /> where is the number of order pairs (v,S), , such that<br /> ,<br...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | Arabic |
| Published: |
Mosul University
2006-12-01
|
| Series: | Al-Rafidain Journal of Computer Sciences and Mathematics |
| Subjects: | |
| Online Access: | https://csmj.mosuljournals.com/article_164061_5e74c038280d8a110cd193d01570d5ac.pdf |
| Summary: | The minimum distance of a vertex v to an set of vertices of a graph G is defined as :<br /> .<br /> The n-Wiener polynomial for this distance of a graph G is defined as<br /> ,<br /> where is the number of order pairs (v,S), , such that<br /> ,<br /> and is the diameter for this minimum n-distance.<br /> 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.<br /> |
|---|---|
| ISSN: | 1815-4816 2311-7990 |