- About this Journal ·
- Abstracting and Indexing ·
- Advance Access ·
- Aims and Scope ·
- Article Processing Charges ·
- Articles in Press ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents

Journal of Discrete Mathematics

Volume 2013 (2013), Article ID 857908, 3 pages

http://dx.doi.org/10.1155/2013/857908

## Terminal Hosoya Polynomial of Line Graphs

^{1}Department of Mathematics, Gogte Institute of Technology, Udyambag, Belgaum 590008, India^{2}Department of Mathematics, Mangalore University, Mangalore 574199, India^{3}Department of Mathematics, Vishwanathrao Deshpande Rural Institute of Technology, Haliyal 581329, India

Received 31 January 2013; Accepted 2 June 2013

Academic Editor: Wai Chee Shiu

Copyright © 2013 H. S. Ramane et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

The terminal Hosoya polynomial of a graph is defined as , where is the number of pairs of pendant vertices of that are at distance . In this paper we obtain terminal Hosoya polynomial of line graphs.

#### 1. Introduction

Let be a connected graph with vertex set and edge set . The * degree* of a vertex in is the number of edges incident to it and is denoted by . If , then is called a * pendant vertex* or * terminal vertex*. An edge of a graph is called a * pendant edge* if or . Two edges are said to be * independent* if they are not adjacent to each other. The * distance* between the vertices and in is equal to the length of a shortest path joining them and is denoted by .

The Hosoya polynomial of a graph is a distance based polynomial introduced by Hosoya [1] in 1988 under the name “Wiener polynomial.” However today it is called the Hosoya polynomial [2–6]. For a connected graph , the * Hosoya polynomial* denoted by is defined as
where is the number of pairs of vertices of that are at distance and is the parameter.

Estrada et al. [7] studied the chemical applications of Hosoya polynomial. The interesting property of is that its first derivative at is equal to the well-known Wiener index of , the sum of the distances between all pairs of vertices of [8]. That is,

Gutman et al. [9] put forward another topological index called * terminal Wiener index * defined as the sum of the distances between all pairs of pendant vertices of . Thus if is the set of pendant vertices of , then

For recent work on the terminal Wiener index, see [10–14].

In analogy of (1), the * terminal Hosoya polynomial * of a graph was put forward by Narayankar et al. [15] and is defined as follows: if , , , are the pendant vertices of , then
where is the number of pairs of pendant vertices of the graph that are at distance .

It is easy to check that

In [15], the terminal Hosoya polynomial of thorn graphs is obtained. In the present paper we obtain the terminal Hosoya polynomial of line graphs.

If the graph has no pendant vertex or has only one pendant vertex, then we write , for .

If we write , where is the diameter of , then for all graphs of order and for , a complete graph on two vertices.

#### 2. Terminal Hosoya Polynomial of Line Graphs

The * line graph* of , denoted by , is the graph whose vertices are the edges of , and two vertices of are adjacent if and only if the corresponding edges are adjacent in .

Theorem 1. *Let be a connected graph with vertices, let , where , and one neighbor of is pendant, . Then
*

*Proof. * Let be the set of pendant edges of and the subset of , where, for each , the edge is incident to the vertex , . Thus, if , then and (or vice versa), .

Consider two edges and of , where and , .

Therefore . Similarly . Therefore and are pendant vertices of . Thus all edges of are the pendant vertices of , and , and . Therefore

Theorem 2. *Let be a connected graph with vertices and the graph obtained by removing pendant vertices of . If (i) or (ii) has no edge such that one of the components of is , and , then
*

*Proof. **Case **1.* It is obvious that (8) holds for .*Case **2.* Let , where , and one neighbor of is pendant, . If and if there is no edge in such that one of the component of is , , then the vertices of the set become pendant in . Therefore
Substituting this in (6) we get

Corollary 3. *Let be a connected graph with vertices and the graph obtained by removing pendant vertices of . If all pendant edges of are mutually independent, then
*

*Proof. * It follows from Theorem 2(ii).

Let be the graph with vertices , , , then is the graph obtained from by adding new vertices , , , and joining to by an edge, . The graph is called the * corona* of [16].

Theorem 4. * Let be a connected graph, then
*

*Proof. *If the graph has number of vertices, then has pendant edges, and all are mutually independent. Removing pendant vertices of we get the graph . Therefore from Corollary 3,

Theorem 5. *Let be a connected graph and , , where and ; then
*

*Proof. *We prove this by induction on .

From Theorem 4,
Let
Therefore

The * subdivision graph * is obtained from by inserting a new vertex of degree 2 on each edge of . The graph is obtained from by inserting new vertices of degree 2 on each edge of . Thus .

Theorem 6. *Let be a connected graph with pendant vertices , , , . Then for ,
*

*Proof. *The pendant vertices of and pendant vertices of are the same. Further all pendant edges of are mutually independent.

Let and be the pendant vertices of ; then and are pendant vertices of . Let and be the subdivision vertices of , where is adjacent to and is adjacent to in . Let be the graph obtained by removing all pendant vertices of . Therefore and are pendant vertices of and . Now, since the pendant edges of are mutually independent, from Corollary 3,

Corollary 7. *Let be a connected graph with pendant vertices , , , . If for all , where , then, for ,
*

*Proof. *It follows from Theorem 6.

#### Acknowledgment

K. P. Narayankar thanks University Grants Commission (UGC), Government of India, for support through MRP no. 39-36/2010 (SR).

#### References

- H. Hosoya, “On some counting polynomials in chemistry,”
*Discrete Applied Mathematics*, vol. 19, no. 1-3, pp. 239–257, 1988. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - Ch. Eslahchi, S. Alikhani, and M. H. Akhbari, “Hosoya polynomial of an infinite family of dendrimer nanostar,”
*Iranian Journal of Mathematical Chemistry*, vol. 2, no. 1, pp. 71–79, 2011. - I. Gutman, “Hosoya polynomial and the distance of the total graph of a tree,”
*Univerzitet u Beogradu. Publikacije Elektrotehničkog Fakulteta. Serija Matematika*, vol. 10, pp. 53–58, 1999. View at Zentralblatt MATH · View at MathSciNet - H. Mohamadinezhad-Rashti and H. Yousefi-Azari, “Some new results on the Hosoya polynomial of graph operations,”
*Iranian Journal of Mathematical Chemistry*, vol. 1, no. 2, pp. 37–43, 2010. - D. Stevanović, “Hosoya polynomial of composite graphs,”
*Discrete Mathematics*, vol. 235, no. 1–3, pp. 237–244, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - H. B. Walikar, H. S. Ramane, L. Sindagi, S. S. Shirkol, and I. Gutman, “Hosoya polynomial of thorn trees, rods, rings and stars,”
*Kragujevac Journal of Mathematics*, vol. 28, pp. 47–56, 2006. - E. Estrada, O. Ivanciuc, I. Gutman, A. Gutierrez, and L. Rodríguez, “Extended Wiener indices. A new set of descriptors for quantitative structure-property studies,”
*New Journal of Chemistry*, vol. 22, no. 8, pp. 819–822, 1998. View at Scopus - H. Wiener, “Structural determination of paraffin boiling points,”
*Journal of the American Chemical Society*, vol. 69, no. 1, pp. 17–20, 1947. View at Scopus - I. Gutman, B. Furtula, and M. Petrović, “Terminal Wiener index,”
*Journal of Mathematical Chemistry*, vol. 46, no. 2, pp. 522–531, 2009. View at Publisher · View at Google Scholar · View at MathSciNet - X. Deng and J. Zhang, “Equiseparability on terminal Wiener index,” in
*Algorithmic Aspects in Information and Management*, A. V. Goldberg and Y. Zhou, Eds., pp. 166–174, Springer, Berlin, Germany, 2009. - I. Gutman and B. Furtula, “A survey on terminal Wiener index,” in
*Novel Molecular Structure Descriptors: Theory and Applications I*, I. Gutman and B. Furtula, Eds., pp. 173–190, University of Kragujevac, Kragujevac, Serbia, 2010. - A. Heydari and I. Gutman, “On the terminal Wiener index of thorn graphs,”
*Kragujevac Journal of Mathematics*, vol. 32, pp. 57–64, 2010. - H. S. Ramane, K. P. Narayankar, S. S. Shirkol, and A. B. Ganagi, “Terminal Wiener index of line graphs,”
*MATCH Communications in Mathematical and in Computer Chemistry*, vol. 69, no. 3, pp. 775–782, 2013. - L. A. Székely, H. Wang, and T. Wu, “The sum of the distances between the leaves of a tree and the semi-regular property,”
*Discrete Mathematics*, vol. 311, no. 13, pp. 1197–1203, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - K. P. Narayankar, S. S. Shirkol, H. S. Ramane, and S. B. Lokesh, “Terminal Hosoya polynomial of thorn graphs,” in
*Proceedings of the International Conference on Discrete Mathematics (ICDM 13)*, Karnatak University, Dharwad, India, June 2013. - F. Harary,
*Graph Theory*, Addison-Wesley, Reading, UK, 1969. View at MathSciNet