%0 Journal Article
%T On the Roots of Hosoya Polynomial of a Graph
%J Iranian Journal of Mathematical Chemistry
%I University of Kashan
%Z 2228-6489
%A REYHANI, M. H.
%A ALIKHANI, S.
%A IRANMANESH, M. A.
%D 2013
%\ 05/01/2013
%V 4
%N 2
%P 231-238
%! On the Roots of Hosoya Polynomial of a Graph
%K Hosoya polynomial
%K root
%K Path
%K Cycle
%R 10.22052/ijmc.2013.5296
%X Let G = (V, E) be a simple graph. Hosoya polynomial of G is d(u,v) H(G, x) = {u,v}V(G)x , where, d(u ,v) denotes the distance between vertices u and v. As is the case with other graph polynomials, such as chromatic, independence and domination polynomial, it is natural to study the roots of Hosoya polynomial of a graph. In this paper we study the roots of Hosoya polynomials of some specific graphs.
%U https://ijmc.kashanu.ac.ir/article_5296_410164e0c444ea9cc736e03dd626520e.pdf