Abstract
The partial Hosoya polynomial (or briefly the partial H-polynomial) can be used to construct the well-known Hosoya polynomial. The ith coefficient of this polynomial, defined for an arbitrary vertex u of a graph G, is the number of vertices at distance i from u. The aim of this paper is to determine the partial H-polynomial of several well-known graphs and, then, to investigate the location of their zeros. To pursue, we characterize the structure of graphs with the minimum and the maximum modulus of the zeros of partial H-polynomial. Finally, we define another graph polynomial of the partial H-polynomial, see [9]. Also, we determine the unique positive root of this polynomial for particular graphs.
Original language | English |
---|---|
Pages (from-to) | 199-215 |
Number of pages | 17 |
Journal | Information Sciences |
Volume | 524 |
DOIs | |
Publication status | Published - 1 Jul 2020 |
Publication type | A1 Journal article-refereed |
Keywords
- Cut-vertex
- Distance
- Hosoya polynomial
- Polynomial roots
Publication forum classification
- Publication forum level 2
ASJC Scopus subject areas
- Software
- Control and Systems Engineering
- Theoretical Computer Science
- Computer Science Applications
- Information Systems and Management
- Artificial Intelligence