The restricted detour distance D*(u, v) between two vertices u and v of G is the length of a longest u – v path P in G such that 〈V(P)〉 = P. The restricted detour polynomial of the graph G is denoted by D*(G; x) and defined as D*(G; x) = ∑u,vxD*(u,v). The restricted detour index dd*(G) of a connected graph G is the Wiener index with respect to restricted detour distance, that is dd*(G) = ∑u,v D*(u,v). In this paper, the restricted detour polynomial and restricted detour index of edge identification of two wheel graphs are obtained.
REFERENCES
1.
Abdullah
, H. O
, “Hosoya polynomial of Steiner Distance of Some Graphs
”, Ph.D. Thesis, University of Salahaddin-Erbil
, Iraq
, (2007
).2.
Abdullah
, H. O.
and Mohammed-Saleh
, G. A
, Rad. J. Comp. Sci. and Maths
, 7
(1
), 139
–154
, (2010
).3.
Ali
, A.A.
and Mohammed-Saleh
, G. A.
, Raf. J. Math. Comput. Sci
, 9
(1
), 139
–146
, (2012
).4.
5.
Ali
, A. M.
, “Weiner Polynomials of Generalized Distance in Graphs
”, M.Sc. Thesis, Mosul University
, Mosul
, (2005
).6.
Chartrand
, G.
, Johns
, G. L.
and Tian
S
, Annals of Discrete Mathematics
, 55
, 127
–136
(1993
).7.
Mohammed-Saleh
, G. A
, “On the Detour Distance and Detour polynomials of graphs
”, Ph.D. Thesis, University of Salahaddin-Erbil
, Iraq
, (2013
).8.
Omar
, Zh. I
, “Restricted detour and edge restricted detour polynomial of some graphs
”, MSc. Thesis, University of Salahaddin-Erbil
, Iraq
, (2016
).9.
This content is only available via PDF.
© 2017 Author(s).
2017
Author(s)