Back to Search
Start Over
Weiner Polynomials for Generalization of Distance for Some Special Graphs
- Source :
- Al-Rafidain Journal of Computer Sciences and Mathematics, Vol 3, Iss 2, Pp 103-120 (2006)
- Publication Year :
- 2006
- Publisher :
- Mosul University, 2006.
-
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.
Details
- Language :
- Arabic, English
- ISSN :
- 18154816 and 23117990
- Volume :
- 3
- Issue :
- 2
- Database :
- Directory of Open Access Journals
- Journal :
- Al-Rafidain Journal of Computer Sciences and Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- edsdoj.fbcdcfa05041487dad81d6c7d4129394
- Document Type :
- article
- Full Text :
- https://doi.org/10.33899/csmj.2006.164061