### Main Subjects : Graph Theory

##### The Restricted Detour Polynomial of the Theta Graph

Herish O. Abdullah; Ivan D. Ali

AL-Rafidain Journal of Computer Sciences and Mathematics, 2020, Volume 14, Issue 1, Pages 13-20
DOI: 10.33899/csmj.2020.164664

The restricted detour distance  D*(u,v) between two vertices u and v of a connected graph G is the length of a longest u - v path P in G such that <V(P)> = P. The main goal of this paper is to obtain the restricted detour polynomial of the theta graph. Moreover, the restricted detour index of the theta graph will also be obtained.

##### Weiner Polynomials for Generalization of Distance for Some Special Graphs

Ali Aziz Ali; Ahmed M. Ali

AL-Rafidain Journal of Computer Sciences and Mathematics, 2006, Volume 3, Issue 2, Pages 103-120
DOI: 10.33899/csmj.2006.164061

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.