No Detail Found!

Clique-to-vertex detour distance in graphs

Author(s)
I. KEERTHI ASIR Department of Mathematics, St. Xavier’s College (Autonomous), Palayamkottai - 627 002, Tamil Nadu, India
S. ATHISAYANATHAN Department of Mathematics, St. Xavier’s College (Autonomous), Palayamkottai - 627 002, Tamil Nadu, India
Abstract
Let C be a clique and v a vertex in a connected graph G. A clique-to-vertex C - v path P is a u - v path, where u is a vertex in C such that P contains no vertices of C other than u. The clique-to-vertex distance, d(C, v) is the length of a smallest C - v path in G. A C - v path of length d(C, v) is called a C - v geodesic. The clique-to-vertex eccentricity e2(C) of a clique C in G is the maximum clique-to-vertex distance from C to a vertex v ? V in G. The clique-to-vertex radius r2 of G is the minimum clique-to-vertex eccentricity among the cliques of G, while the clique-to-vertex diameter d2 of G is the maximum cliqueto-vertex eccentricity among the cliques of G. Also The clique-to-vertex detour distance, D(C, v) is the length of a longest C - v path in G. A C - v path of length D(C, v) is called a C - v detour. The clique-to-vertex detour eccentricity eD2(C) of a clique C in G is the maximum clique-tovertex detour distance from C to a vertex v ? V in G. The clique-to-vertex detour radius R2 of G is the minimum clique-to-vertex detour eccentricity among the cliques of G, while the clique-to-vertex detour diameter D2 of G is the maximum clique-to-vertex detour eccentricity among the cliques of G. It is shown that R2 = D2 for every connected graph G and that every two positive integers a and b with 2 = a = b are realizable as the clique-tovertex detour radius and the clique-to-vertex detour diameter respectively of some connected graph. Also it is shown that for any two positive integers a and b with 2 = a = b, there exists a connected graph G such that r2 = a, R2 = b and it is shown that for any two positive integers a and b with 2 = a = b, there exists a connected graph G such that d2 = a, D2 = b.
Publication Details
Page(s) 42-54
DOI DOI not available
Published Journal: Journal of Prime Research in Mathematics, Volume: 11, Issue: 1, Year: 2015

Request the full text from PASTIC

Keywords
AMS SUBJECT, Primary 05C12, clique-to-vertex detour center, clique-to-vertex detour periphery, clique-to-vertex detour distance
References
Santhakumaran A. P.,S. A. P. . .Arumugam: Centrality with respect to Cliques. International Journal of Management and Systems, 3(2002) : 275-280.
Buckley F.,Harary F. .1990 .. , : .
Harary F.,R. Z. Norman: F. .1953 .The dissimilarity characteristics of Husimi trees. IAnn. of Math, 58 : 134-141.
Chartrand and H. Escuadro G. .2005 .. J.Combin.Math.Combin.Comput., 53 : 75-94.
Chartrand G.,P. Zhang: G.,Graphs AKCE J. . .Distance in Graphs - Taking the Long View. , 1(2004) : 1-13.
Chartrand G.,Zhang P.,Tata McGraw-Hill P. .2006 .. , : .
Asir I. Keerthi,Athisayanathan: S. . .. , : .
Philip A.,Ostrand A. .1973 .: Graphs with specified radius and diameter. Discrete Mathematics, 4 : 71-75.
0

Citations

0

Downloads

40

Views