Scrambling Index dari Graf Terdiri Atas Dua Cycle Ganjil yang dihubungkan oleh Beberapa Lintasan

dc.contributor.advisor	Suwilo, Saib
dc.contributor.advisor	Mardiningsih
dc.contributor.author	Atikah, Sundari
dc.date.accessioned	2022-12-29T04:32:20Z
dc.date.available	2022-12-29T04:32:20Z
dc.date.issued	2015
dc.identifier.uri	https://repositori.usu.ac.id/handle/123456789/79048
dc.description.abstract	The scrambling index of a primitive graph G is the smallest positive integer k such that for each pair of vertices u dan v there is a vertex w that we can get to w from u and v in G by walks of lenght k. We discuss the scrambling index of primitive graph G consisting of two disjoint odd cycles each of length sconnected by some paths of length `. For such primitive graphs G we present formulae for scrambling index that depend on s and `.	en_US
dc.language.iso	id	en_US
dc.publisher	Universitas Sumatera Utara	en_US
dc.subject	primitive graph	en_US
dc.subject	scrambling index	en_US
dc.subject	odd cycle	en_US
dc.title	Scrambling Index dari Graf Terdiri Atas Dua Cycle Ganjil yang dihubungkan oleh Beberapa Lintasan	en_US
dc.identifier.nim	NIM110803048
dc.identifier.nidn	NIDN0009016402
dc.identifier.nidn	NIDN0005046302
dc.identifier.kodeprodi	KODEPRODI44201#Matematika
dc.description.pages	43 Halaman	en_US
dc.description.type	Skripsi Sarjana	en_US