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 |