Abstract
A subset S of a connected graph G of order n is called a detour set of G if for every vertex x in G there exist vertices u; v in S such that x lie on a u – v detour path. The detour number dn(G) of a graph G is the minimum cardinality of a detour set. In this paper we compute the detour number of certain 1-fault connected planar graphs.
Get full access to this article
View all access options for this article.