Dekomposisi Graf Piramida

dc.contributor.advisor	Suwilo, Saib
dc.contributor.author	Hestiana, Hestiana
dc.date.accessioned	2024-01-22T04:12:24Z
dc.date.available	2024-01-22T04:12:24Z
dc.date.issued	2023
dc.identifier.uri	https://repositori.usu.ac.id/handle/123456789/90438
dc.description.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−.	en_US
dc.language.iso	id	en_US
dc.publisher	Universitas Sumatera Utara	en_US
dc.subject	Decomposition graph	en_US
dc.subject	graph	en_US
dc.subject	pyramid graph	en_US
dc.subject	isomorphic graph	en_US
dc.subject	subgraph	en_US
dc.title	Dekomposisi Graf Piramida	en_US
dc.type	Thesis	en_US
dc.identifier.nim	NIM170803024
dc.identifier.nidn	NIDN0009016402
dc.identifier.kodeprodi	KODEPRODI44201#Matematika
dc.description.pages	41 Halaman	en_US
dc.description.type	Skripsi Sarjana	en_US