TUTCRIS - Tampereen teknillinen yliopisto

TUTCRIS

On the zeros of the partial Hosoya polynomial of graphs

Tutkimustuotosvertaisarvioitu

Standard

On the zeros of the partial Hosoya polynomial of graphs. / Ghorbani, Modjtaba; Dehmer, Matthias; Cao, Shujuan; Feng, Lihua; Tao, Jin; Emmert-Streib, Frank.

julkaisussa: Information Sciences, Vuosikerta 524, 01.07.2020, s. 199-215.

Tutkimustuotosvertaisarvioitu

Harvard

Ghorbani, M, Dehmer, M, Cao, S, Feng, L, Tao, J & Emmert-Streib, F 2020, 'On the zeros of the partial Hosoya polynomial of graphs', Information Sciences, Vuosikerta. 524, Sivut 199-215. https://doi.org/10.1016/j.ins.2020.03.011

APA

Ghorbani, M., Dehmer, M., Cao, S., Feng, L., Tao, J., & Emmert-Streib, F. (2020). On the zeros of the partial Hosoya polynomial of graphs. Information Sciences, 524, 199-215. https://doi.org/10.1016/j.ins.2020.03.011

Vancouver

Ghorbani M, Dehmer M, Cao S, Feng L, Tao J, Emmert-Streib F. On the zeros of the partial Hosoya polynomial of graphs. Information Sciences. 2020 heinä 1;524:199-215. https://doi.org/10.1016/j.ins.2020.03.011

Author

Ghorbani, Modjtaba ; Dehmer, Matthias ; Cao, Shujuan ; Feng, Lihua ; Tao, Jin ; Emmert-Streib, Frank. / On the zeros of the partial Hosoya polynomial of graphs. Julkaisussa: Information Sciences. 2020 ; Vuosikerta 524. Sivut 199-215.

Bibtex - Lataa

@article{62f43564983e428eb200530788c3de4b,
title = "On the zeros of the partial Hosoya polynomial of graphs",
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.",
keywords = "Cut-vertex, Distance, Hosoya polynomial, Polynomial roots",
author = "Modjtaba Ghorbani and Matthias Dehmer and Shujuan Cao and Lihua Feng and Jin Tao and Frank Emmert-Streib",
year = "2020",
month = "7",
day = "1",
doi = "10.1016/j.ins.2020.03.011",
language = "English",
volume = "524",
pages = "199--215",
journal = "Information Sciences",
issn = "0020-0255",
publisher = "Elsevier",

}

RIS (suitable for import to EndNote) - Lataa

TY - JOUR

T1 - On the zeros of the partial Hosoya polynomial of graphs

AU - Ghorbani, Modjtaba

AU - Dehmer, Matthias

AU - Cao, Shujuan

AU - Feng, Lihua

AU - Tao, Jin

AU - Emmert-Streib, Frank

PY - 2020/7/1

Y1 - 2020/7/1

N2 - 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.

AB - 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.

KW - Cut-vertex

KW - Distance

KW - Hosoya polynomial

KW - Polynomial roots

U2 - 10.1016/j.ins.2020.03.011

DO - 10.1016/j.ins.2020.03.011

M3 - Article

VL - 524

SP - 199

EP - 215

JO - Information Sciences

JF - Information Sciences

SN - 0020-0255

ER -