CLIQUE OF MAXIMUM SIZE FROM A GIVEN GRAPH

Abstract

In this paper, (i) we provide a algorithm to find clique of maximum size from a given graph G, using the concept of maximum degree vertex and sub graph obtained by deleting vertex of maximum degree with concept of recurrence function on sub graph and (ii) we also determine maximum non-commutative set from the non-abelian group

Keywords: Graph, sub graph, clique, degree of a vertex, maximum degree

2010 Mathematics subject classification: 90C59, 68R10, 05C07