Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
470755 | Computers & Mathematics with Applications | 2010 | 9 Pages |
Abstract
The aim of this paper is to find a new expression for distance-based graph invariants of connected graphs having a decomposition into convex subgraphs. We apply this method to Schultz and Gutman indices of graphs. It can be generalized to other distance-based graph invariants. As an application, the Wiener index of the one-pentagonal nanocone is computed.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
M.H. Khalifeh, H. Yousefi-Azari, A.R. Ashrafi,