No Detail Found!

Forcing edge detour number of an edge detour graph.

Author(s)
A. P. Santhakumaran Research Department of Mathematics, St. Xavier’s CollegeUP, (Autonomous), Palayamkottai – 627 002, India
S. Athisayanathan Research Department of Mathematics, St. Xavier’s CollegeUP, (Autonomous), Palayamkottai – 627 002, India
Abstract
For two vertices u and v in a graph G = (V,E), the detour distance D(u,v) is the length of a longest u-v path in G. A u-v path of length D(u,v) is called a u-v detour. A set S Í V is called an edge detour set if every edge in G lies on a detour joining a pair of vertices of S. The edge detour number dni (G) of G is the minimum order of its edge detour sets and any edge detour set of order dn1(G) is an edge detour basis of G. A connected graph G is called an edge detour graph if it has an edge detour set. A subset T of an edge detour basis S of an edge detour graph G is called a forcing subset for S if S is the unique edge detour basis containing T. A forcing subset for S of minimum cardinality is a minimum forcing subset of S. The forcing edge detour number f dni (S) of S, is the minimum cardinality of a forcing subset for S. The forcing edge detour number fdnl(G) of G, is min{fdnl(S)}, where the minimum is taken over all edge detour bases S in G. The general properties satisfied by these forcing subsets are discussed and the forcing edge detour numbers of certain classes of standard edge detour graphs are determined. The parameters dn1(G) and fdn1(G) satisfy the relation 0 £ fdn1(G) £ dn1(G) and it is proved that for each pair a,b of integers with 0 £ a £ b and b £ 2, there is an edge detour graph G with fdn1(G) = a and dn1(G) = b.
Publication Details
Page(s) 13-21
DOI DOI not available
Published Journal: Journal of Prime Research in Mathematics, Volume: 6, Issue: 0, Year: 2010

Request the full text from PASTIC

0

Citations

0

Downloads

40

Views