Szeged Index – Applications for Drug Modeling# Page 1 606 Letters in Drug Design &
Discovery, 2005, 2, 606-624 Szeged Index – Applications for Drug Modeling# Padmakar V …

In this paper we consider three classes of chain hexagonal cacti and study their matching
and independence related properties. Explicit recurrences are derived for their matching …

In this paper we use the concept of k-domination, where k≥ 1. We determine minimum k-
dominating sets and k-domination numbers of three special types of hexagonal cactus …

We show that, for any fixed constant k⩾ 3, the sum of the distances between all pairs of
vertices of an abstract graph with n vertices and treewidth at most k can be computed in O …

In this paper we consider the number of dominating sets in cactus chains with triangular and
square blocks. We derive and solve the recurrences satisfied by those quantities and …

Closeness is a measure of centrality, an important feature of communication and social
networks. Extremal networks among all graphs and among several subclasses of graphs …

Background Depending on their specific structures, noncoding RNAs (ncRNAs) play
important roles in many biological processes. Interest in develo** new topological indices …

The Wiener polynomial of a graph G is a generating function for the distance distribution dd
(G)=(D1, D2,…, Dt), where Di is the number of unordered pairs of distinct vertices at distance …

Introduction/purpose: A graph as a mathematical object occupies a special place in science.
Graph theory is increasingly used in many spheres of business and scientific fields. This …

There has been a great deal of interest in the computation of distances and shortest paths
problem in graphs which is one of the central, and most studied, problems in (algorithmic) …