International Journal of Advanced Networking and Applications

Open Access Open Access  Restricted Access Subscription Access

Algorithms to Find Vertex-to-Clique Center in a Graph using BC-Representation


Affiliations
1 Department of Computer Science, Alagappa Government Arts College, Karaikudi - 630003, India
2 Research Department of Mathematics, St. Xavier’s College (Autonomous), Palayamkottai − 627002, India
3 Ananda College, Devakottai, India
 

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.

Keywords

Clique, Distance, Eccentricity, Radius, Center, Binary Count.
User
Notifications
Font Size

Abstract Views: 115

PDF Views: 4




  • Algorithms to Find Vertex-to-Clique Center in a Graph using BC-Representation

Abstract Views: 115  |  PDF Views: 4

Authors

A. Ashok Kumar
Department of Computer Science, Alagappa Government Arts College, Karaikudi - 630003, India
S. Athisayanathan
Research Department of Mathematics, St. Xavier’s College (Autonomous), Palayamkottai − 627002, India
A. Antonysamy
Ananda College, Devakottai, India

Abstract


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.

Keywords


Clique, Distance, Eccentricity, Radius, Center, Binary Count.