Dekomposisi Graf Piramida

Abstract

Let is a graph consisting of a setcalled vertices adn a set ) called edges. Let is a subgraph of if )⊆) and ⊆. A decomposition of a graph is a collection of subgraph induced by , thus for =1,2,3,…, and graph for is a graph, then decomposition of graph is The decomposition of a graph aims to see the graph into a simpler form. In this research has been obtained A Decomposition of Pyramid Graph is Graph 3 called 3−.