Algorithm to Find Clique Graph
Journal: International Journal of Advanced Networking and Applications (Vol.4, No. 01)Publication Date: 2012-07-02
Authors : A. Ashok Kumar; S. Athisayanathan; A. Antonysamy;
Page : 1501-1502
Keywords : binary count; clique; clique graph; powerset.;
Abstract
Let V = {1, 2, 3, …, n} be the vertex set of a graph G, ( (V ) the powerset of V and A ∈ V ). Then (x1x2x3…xn) where xi A can be represented as an ordered n-tuple = 1 if i ∈ A, otherwise xi = 0 (1? i ? n). This representation is called binary count (or BC) representation of a set A and denoted as BC(A). Given a graph G of order n, every integer m in S = {0, 1, 2, …, 2n
-1} corresponds to a subset A of V and vice versa. In this paper we introduce and discuss a sequential algorithm to find the clique graph K(G) of a graph G using the BC representation.
Other Latest Articles
- Healthcare Monitoring System Using Wireless Sensor Network
- A Distributed and Co-Operative Approach To Botnet Detection Using Gossip Protocol
- Surveying Solutions to Securing On-Demand Routing Protocols in MANETs
- Signal Groups of Compatible Graph in Traffic Control Problems
- Modbus based Multinode Irrigation Automation
Last modified: 2015-12-02 20:43:33