Abstract Views :170 |
PDF Views:0
Authors
Affiliations
1 Ramanujan Institute, University of Madras, Madras-600 005, IN
Source
Journal of the Ramanujan Mathematical Society, Vol 7, No 1 (1992), Pagination: 83-92
Abstract
In this paper some results on self-centered graphs are given in three sections. In the first section an algorithmic procedure to find the minimum number n for a given graph G such that Gn is self-centered is given. In the second section two problems on the construction of self-centered graphs by adding or removing lines to a given non-self-centered graph are discussed. In the thrid section some self-centered graphs with self-centered complements are studied.