Weiner Polynomials for Generalization of Distance for Some Special Graphs
Section: Research Paper
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.
Identifiers
Download this PDF file
Statistics
How to Cite
M. Ali, A., علی, Aziz Ali, A., & أحمد. (2025). Weiner Polynomials for Generalization of Distance for Some Special Graphs. AL-Rafidain Journal of Computer Sciences and Mathematics, 3(2), 103–120. Retrieved from https://rjps.uomosul.edu.iq/index.php/csmj/article/view/19340