期刊名称：International Journal of Advanced Networking and Applications
电子版ISSN：0975-0290
出版年度：2012
卷号：4
期号：1
页码：1501-1502
出版社：Eswar Publications
摘要：Let V = {1, 2, 3, ¡, n} be the vertex set of a graph G, (V ). Then (x1x2x3¡xn) where xi= 1 if i ¡ÊA can be represented as an ordered n-tuple 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
