Journal article
Gamatika
• 2011

AsÂ technology advancesÂ the development of mathematicsÂ is also growing, one of mathematical analysis particularly method graph that needs to be developed is the analysis of the perfect graph. Perfect graphÂ is a graphÂ that has chromatik numbers and numbers of Â the same clique . Numbers khromatik is the smallest number in Â a given coloring dots owned graph G such that for every two points areÂ connected directlyÂ to getÂ different colors. While theÂ number CliqueÂ isÂ the maximumÂ orderÂ ofÂ a completeÂ subgraph whichÂ can be formed of a graph G with the order of G is the number of dots that are owned by the graph G. Based on the discussionÂ in this articleÂ is obtainedÂ that the emptyÂ graph,Â completeÂ graph,Â completeÂ bipartiteÂ graph,Â graphÂ sikel even, and the graphÂ trajectoryÂ is a graph perfectÂ for each graph has chromatikÂ numbersandÂ numbersÂ of the sameÂ clique .