Open Access
Subscription Access
Open Access
Subscription Access
On Self-Centered Graphs
Subscribe/Renew Journal
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.
User
Subscription
Login to verify subscription
Font Size
Information
Abstract Views: 233
PDF Views: 0