z-logo
open-access-imgOpen Access
Terminal Hosoya Polynomial of Line Graphs
Author(s) -
Harishchandra S. Ramane,
Asha B. Ganagi,
Kishori P. Narayankar,
Shailaja S. Shirkol
Publication year - 2013
Publication title -
journal of discrete mathematics
Language(s) - English
Resource type - Journals
eISSN - 2090-9837
pISSN - 2090-9845
DOI - 10.1155/2013/857908
Subject(s) - algorithm , computer science
The terminal Hosoya polynomial of a graph G is defined as TH(G,λ)=∑k≥1dT(G,k)λk, where dT(G,k) is the number of pairs of pendant vertices of G that are at distance k. In this paper we obtain terminal Hosoya polynomial of line graphs

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom