Algorithms to find clique-to-vertex Structures in a Graph using BC-representation

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.