CLIQUE OF MAXIMUM SIZE FROM A GIVEN GRAPH
Main Article Content
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
Downloads
Article Details
Open Access: This is an open-access journal. All articles published in the Journal of Global Research in Mathematical Archives(JGRMA) are made immediately and permanently available under the Creative Commons Attribution 4.0 International (CC BY 4.0) License. Authors retain the copyright of their work and grant Journal of Global Research in Mathematical Archives(JGRMA) the right of first publication. This license permits unrestricted use, distribution, adaptation, and reproduction in any medium or format, including commercial use, provided the original author(s), source, and license are properly acknowledged.
Google Scholar Indexed | DOI Enabled | OAI-PMH Compliant | Open Access Journal