A survey on graphs extremal with respect to distance-based topological indices

K Xu, M Liu, I Gutman, B Furtula - MATCH Communications in …, 2014 - scidar.kg.ac.rs
A Survey on Graphs Extremal with Respect to Distance–Based Topological Indices Page 1 A
Survey on Graphs Extremal with Respect to Distance–Based Topological Indices Kexiang Xua …

PaDEL‐descriptor: An open source software to calculate molecular descriptors and fingerprints

CW Yap - Journal of computational chemistry, 2011 - Wiley Online Library
Abstract Introduction PaDEL‐Descriptor is a software for calculating molecular descriptors
and fingerprints. The software currently calculates 797 descriptors (663 1D, 2D descriptors …

Wiener index of trees: theory and applications

AA Dobrynin, R Entringer, I Gutman - Acta Applicandae Mathematica, 2001 - Springer
The Wiener index W is the sum of distances between all pairs of vertices of a (connected)
graph. The paper outlines the results known for W of trees: methods for computation of W …

Wiener index of hexagonal systems

AA Dobrynin, I Gutman, S Klavžar, P Žigert - Acta Applicandae …, 2002 - Springer
The Wiener index W is the sum of distances between all pairs of vertices of a (connected)
graph. Hexagonal systems (HS's) are a special type of plane graphs in which all faces are …

On topological indices, boiling points, and cycloalkanes

G Rücker, C Rücker - Journal of chemical information and …, 1999 - ACS Publications
The experimental boiling points (bp) of saturated hydrocarbons (acyclic through polycyclic)
up to decanes are systematically compiled. The bp values are classified into groups of lower …

Extensions of the Wiener number

HY Zhu, DJ Klein, I Lukovits - Journal of chemical information and …, 1996 - ACS Publications
Particularly for structure− property correlations there are many chemical graph-theoretic
indices, one of which is Wiener's “path number”. Because Wiener's original work focused on …

[PDF][PDF] Vertex-weighted Wiener polynomials for composite graphs

T Došlic - Ars Math. Contemp, 2008 - researchgate.net
Recently introduced vertex-weighted Wiener polynomials are a generalization of both vertex-
weighted Wiener numbers and ordinary Wiener polynomials. We present here explicit …

[图书][B] Graph-theoretical matrices in chemistry

D Janezic, A Milicevic, S Nikolic, N Trinajstic - 2015 - books.google.com
Divided into five sections, this book offers 200 graph-theoretical matrices covering
adjacency and related matrices, distance and related matrices, incidence matrices, and …

Wiener number of vertex-weighted graphs and a chemical application

S Klavžar, I Gutman - Discrete applied mathematics, 1997 - Elsevier
The Wiener number W (G) of a graph G is the sum of distances between all pairs of vertices
of G. If (G, w) is a vertex-weighted graph, then the Wiener number W (G, w) of (G, w) is the …

Resistance distance in regular graphs

I Lukovits, S Nikolić, N Trinajstić - International Journal of …, 1999 - Wiley Online Library
This report considers the resistance distance as a recently proposed new intrinsic metric on
(molecular) graphs, and in particular, the sum R over resistance distances between all pairs …