1996
DOI: 10.1002/(sici)1097-461x(1996)60:5<959::aid-qua2>3.0.co;2-w
|View full text |Cite
|
Sign up to set email alerts
|

The Wiener polynomial of a graph

Abstract: rnThe Wiener index is a graphical invariant that has found extensive application in chemistry. We define a generating function, which we call the Wiener polynomial, whose derivative is a q-analog of the Wiener index. We study some of the elementary properties of this polynomial and compute it for some common graphs. We then find a formula for the Wiener polynomial of a dendrimer, a certain highly regular tree of interest to chemists, and show that it is unimodal. Finally, we point out a connection with the Poi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
29
0

Year Published

2000
2000
2019
2019

Publication Types

Select...
7
2

Relationship

1
8

Authors

Journals

citations
Cited by 100 publications
(32 citation statements)
references
References 7 publications
(2 reference statements)
1
29
0
Order By: Relevance
“…The (unweighted) Wiener polynomial of G is defined as P 0 (G; x) = {u,v}⊆V (G) x d (u,v) , with x a dummy variable. This coincides with definitions of Hosoya [17] and Sagan et al [23]. Some authors prefer the name Hosoya polynomial.…”
Section: Introductionsupporting
confidence: 87%
“…The (unweighted) Wiener polynomial of G is defined as P 0 (G; x) = {u,v}⊆V (G) x d (u,v) , with x a dummy variable. This coincides with definitions of Hosoya [17] and Sagan et al [23]. Some authors prefer the name Hosoya polynomial.…”
Section: Introductionsupporting
confidence: 87%
“…The Wiener index of the Cartesian product of graphs was studied in [7,20]. In [17], Klavžar, Rajapakse and Gutman computed the Szeged index of the Cartesian product graphs.…”
Section: Resultsmentioning
confidence: 99%
“…As usual, the distance between the vertices u and v of G is denoted by d G (u, v) (d(u, v) for short). It is defined as the length of a minimum path connecting them and d G (u)(d(u) for short) denotes the degree of u in G. The Wiener index of a graph G is defined as W (G) = {u,v} d (u, v) [7,17,20,23]. GA 2 index of the graph of G is defined by GA 2 (G) =…”
Section: Introductionmentioning
confidence: 99%
“…The Wiener index of the Cartesian product graphs was studied in [5,19]. In [14], Klavžar, Rajapakse and Gutman computed the Szeged index of the Cartesian product graphs.…”
Section: Resultsmentioning
confidence: 99%