%0 Journal Article
%T Algorithms to find clique-to-vertex Structures in a Graph using BC-representation
%A A. Ashok Kumar
%A S. Athisayanathan
%A A. Antonysamy
%J International Journal of Research in Computer Applications and Robotics
%D 2013
%I 
%X In this paper, we introduce algorithms to find the clique-to-vertex (or (¦Æ, V ))-distance d(C, v) between a clique C and avertex v in a graph G, (¦Æ, V )-eccentricity e2 (C ) of a clique C , and (¦Æ, V )-center Z2(G) of a graph G using BC -representation. Moreover, the algorithms are proved for their correctness and analysed for their time complexity.
%K clique
%K distance
%K eccentricity
%K radius
%K center
%K binary count
%U http://ijrcar.in/Volume%201%20Issue%201/v1i1201301.pdf