Finding Maximal Clique In A Graph
Journal Title: UNKNOWN - Year 2015, Vol 4, Issue 3
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.
Authors and Affiliations
Keywords
Related Articles
- EP ID EP357607
- DOI -
- Views 79
- Downloads 0
Role of Platelet Indices in Patients with Dengue Infection in Red Sea State, Sudan
Dengue is a global endemic and most prevalent human arbovirus disease. Recently, platelet indices have been assessed usefully in the diagnosis conditions with abnormal platelet counts. A case control study was conducted...
General Analysis Process of Bacterial Communities
This paper generalizes the process of analysis bacterial communities from tissues and natural environment for people who are not familiar with the analysis using the computer. This paper is a short article consisting of...
Performance of Microimmunofluorescence Test in Detection of anti-ChlamydiaTrachomatis Immunog-lobulinsin Iraqi Infertile Males with Special Refer to Age Group Distribution
"Background: The incidence of anti-chlamydia trachomatis immunoglobulins in serninal plasma and serum of infertile men was detected by microimmunofluorscence (MIF) test .The main objective was to determine and compare...
Enhanced Mobile Robot for Detection of Water Quality
Water quality monitoring is very essential in recent years since many factors pollute the water resources. The robots that are in use for monitoring the water quality that is unable to protect itself from damage. The dat...
Group Formation with Neighbour Similarity Trust in P2P E-Commerce
This paper is based on networking in predicting the trust between Peer to peer (P2P) e-commerce applications with liabilities to passive and active attacks. These attacks have turned out the potential business firms and...