No Detail Found!

Vertex-to-clique detour distance in graphs

Author(s)
I. KEERTHI ASIR Department of Mathematics, St. Xavier's College (Autonomous), Palayamkottai 627002, Tamil Nadu, India.
S. ATHISAYANATHAN Department of Mathematics, St. Xavier's College(Autonomous),Palayamkottai 627002, Tamil Nadu, India
Abstract
Let v be a vertex and C a clique in a connected graph G. A vertex-to-clique u ¡ C path P is a u ¡ v path, where v is a vertex in C such that P contains no vertices of C other than v. The vertex-to-clique distance, d(u; C) is the length of a smallest u¡C path in G. A u¡C path of length d(u; C) is called a u ¡ C geodesic. The vertex-to-clique eccentricity e1(u) of a vertex u in G is the maximum vertex-to-clique distance from u to a clique C 2 ³, where ³ is the set of all cliques in G. The vertex-to-clique radius r1 of G is the minimum vertex-to-clique eccentricity among the vertices of G, while the vertex-to-clique diameter d1 of G is the maximum vertex-to-clique eccentricity among the vertices of G. Also the vertex-toclique detour distance, D(u; C) is the length of a longest u¡C path in G. A u ¡ C path of length D(u; C) is called a u ¡ C detour. The vertex-to-clique detour eccentricity eD1(u) of a vertex u in G is the maximum vertex-toclique detour distance from u to a clique C 2 ³ in G. The vertex-to-clique detour radius R1 of G is the minimum vertex-to-clique detour eccentricity among the vertices of G, while the vertex-to-clique detour diameter D1 of G is the maximum vertex-to-clique detour eccentricity among the vertices of G. It is shown that R1 · D1 for every connected graph G and that every two positive integers a and b with 2 · a · b are realizable as the vertex-to-clique detour radius and the vertex-to-clique detour diameter, respectively, of some connected graph. Also it is shown that for any three positive integers a; b; c with 2 · a · b < c, there exists a connected graph G such that r1 = a, R1 = b, R = c and for any three positive integers a; b; c with 2 · a · b < c and a + c · 2b, there exists a connected graph G such that d1 = a, D1 = b, D = c.
Publication Details
Page(s) 45-59
DOI DOI not available
Published Journal: Journal of Prime Research in Mathematics, Volume: 12, Issue: 1, Year: 2016

Request the full text from PASTIC

Keywords
05C12, AMS Subject Classi¯cation, vertex-to-clique detour distance, vertex-to-clique distance, vertex-to-clique detour center, vertex-to-clique detour periphery
References
Chartrand and H. Escuadro G. .2005 .. J.Combin.Math.Combin.Comput., 53 : 75-94.
Chartrand G.,Zhang P.,Tata McGraw-Hill P. .2006 .. , : .
Hakimi S. L. .1964 .Optimum location of switching centers and absolute centers and medians of a graph. Operations Research, 12 : .
Harary F.,R. Z. Norman: F. .1953 .The dissimilarity characteristics of Husimi trees. , 58 : 134-141.
Philip A.,Ostrand A. .1973 .: Graphs with speci¯ed radius and diameter. Discrete Mathematics, 4 : 71-75.
Santhakumaran A. P.,S. A. P. .2002 .Arumugam: Centrality with respect to Cliques. International Journal of Management and Systems, 18(3) : 275-280.
0

Citations

0

Downloads

50

Views