International Journal of Science and Research (IJSR)

International Journal of Science and Research (IJSR)
Call for Papers | Fully Refereed | Open Access | Double Blind Peer Reviewed

ISSN: 2319-7064


Downloads: 101

Research Paper | Mathematics | Indonesia | Volume 4 Issue 3, March 2015


Finding Maximal Clique In A Graph

Wiwin Apriani [2] | Novida Sari Sihombing | Zullidar Habsyah | Saib Suwilo


Abstract: Given a simple graph G with n vertices. Furthermore, given an algorithm to get maximal clique in graph G. Clique Q of G is a set of vertices, where each vertex are connected to each other. Clique is called maximal clique when it does not have vertices that adjoinable again. For finding maximal clique Qi used the Maximal Clique Algorithm. This algorithm can be used to obtain the maximum clique on certain graph models. Maximal cliques can be very small, when a graph may contain a non-maximal clique with many vertices and a separate clique of size two which is maximal. A maximum clique is necessarily maximal clique, but does not converse. There are some types of graphs, which every maximal clique is maximum clique, that is complete graphs, triangle-free graphs, and complete multipartite graphs. But the other graphs have maximal cliques that are not maximum.


Keywords: Clique, Maximal clique, Maximum clique, and Adjoinable vertices


Edition: Volume 4 Issue 3, March 2015,


Pages: 2055 - 2057


How to Download this Article?

You Need to Register Your Email Address Before You Can Download the Article PDF


How to Cite this Article?

Wiwin Apriani, Novida Sari Sihombing, Zullidar Habsyah, Saib Suwilo, "Finding Maximal Clique In A Graph", International Journal of Science and Research (IJSR), Volume 4 Issue 3, March 2015, pp. 2055-2057, https://www.ijsr.net/get_abstract.php?paper_id=SUB152533

Top