| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4640469 | Journal of Computational and Applied Mathematics | 2011 | 5 Pages |
Abstract
The edge Szeged and edge Wiener indices of graphs are new topological indices presented very recently. It is not difficult to apply a modification of the well-known cut method to compute the edge Szeged and edge Wiener indices of hexagonal systems. The aim of this paper is to propose a method for computing these indices for general graphs under some additional assumptions.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
H. Yousefi-Azari, M.H. Khalifeh, A.R. Ashrafi,