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 …

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 …

The Wiener index is equal to the sum of distances between all pairs of vertices of the
underlying (connected) graph. The edge-Wiener index is conceived in an analogous …

A linear time algorithm is presented which, for a given benzenoid system G, computes the
Wiener index of G. The algorithm is based on an isometric embedding of G into the …

Roman domination is an historically inspired variety of domination in graphs, in which
vertices are assigned a value from the set $\{0, 1, 2\} $ in such a way that every vertex …

Using algebraic approach we implement a constant time algorithm for computing the
domination numbers of the Cartesian products of paths and cycles. Closed formulas are …

A matching M in a graph G is maximal if it cannot be extended to a larger matching in G. In
this paper we show how several chemical and technical problems can be successfully …

The modified Wiener index is an algebraic modification of the classical Wiener index under
symmetry group. This graph invariant was presented by Graovac and Pisanski in 1991. In …

Sažetak Let G be a simple connected graph. The distance between the edges g and f E (G)
is defined as the distance between the corresponding vertices g and f in the line graph of G …

Ce mémoire présente quelques résultats récents sur les codes identifiants. La thèse est
structurée en cinq chapitres. Le Chapitre 1 contient les définitions et présente la notion de …