期刊名称：International Journal of Advanced Networking and Applications
电子版ISSN：0975-0290
出版年度：2013
卷号：4
期号：6
页码：1809-1811
出版社：Eswar Publications
摘要：In this paper, we introduce algorithms to find the vertex-to-clique (or (V, ζ ))-distance d(v, C ) between a vertex v and a clique C in a graph G, (V, ζ )-eccentricity e1 (v) of a vertex v, and (V, ζ )-center Z1(G) of a graph G usingBC - representation. Moreover, the algorithms are proved for their correctness and analyzed for their time complexity.
