Premium
Wiener polynomials of some chemically interesting graphs
Author(s) -
Yang BoYin,
Yeh YeongNan
Publication year - 2004
Publication title -
international journal of quantum chemistry
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.484
H-Index - 105
eISSN - 1097-461X
pISSN - 0020-7608
DOI - 10.1002/qua.20100
Subject(s) - combinatorics , wiener index , graph , mathematics , polynomial , quantum chemical , discrete mathematics , physics , quantum mechanics , molecule , mathematical analysis
The chemist Harold Wiener found ( G ), the sum of distances between all pairs of vertices in a connected graph G , to be useful as a predictor of certain physical and chemical properties. The q ‐analogue of , called the Wiener polynomial ( G ; q ), is also useful, but it has few existing useful formulas. We will evaluate ( G ; q ) for certain graphs G of chemical interest. © 2004 Wiley Periodicals, Inc. Int J Quantum Chem, 2004
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom