Daftar Isi: KERNEL PADA TEORI GRAPH

Main Author:	ASTINI, NI NYOMAN YENI
Format:	Thesis NonPeerReviewed application/pdf
Terbitan:	, 1993
Subjects:	QA Mathematics
Online Access:	http://eprints.undip.ac.id/32340/1/M93_Ni_nyoman_Yeni_Astini.pdf http://eprints.undip.ac.id/32340/2/M93_Ni_nyoman_Yeni_Astini_cover.pdf http://eprints.undip.ac.id/32340/3/M93_Ni_nyoman_Yeni_Astini_summary.pdf http://eprints.undip.ac.id/32340/4/M93_Ni_nyoman_Yeni_Astini_preliminary.pdf http://eprints.undip.ac.id/32340/5/M93_Ni_nyoman_Yeni_Astini_chapter_I.pdf http://eprints.undip.ac.id/32340/6/M93_Ni_nyoman_Yeni_Astini_chapter_II.pdf http://eprints.undip.ac.id/32340/7/M93_Ni_nyoman_Yeni_Astini_chapter_III.pdf http://eprints.undip.ac.id/32340/8/M93_Ni_nyoman_Yeni_Astini_chapter_IV.pdf http://eprints.undip.ac.id/32340/9/M93_Ni_nyoman_Yeni_Astini_reference.pdf http://eprints.undip.ac.id/32340/

Daftar Isi:

Berlatar belakang pada pengertian kernel dan teori graph maka 1 - graph G = ( X , 1 ) dikatakan mempunyai kernel yang diberi notasi S, untuk setiap S C X jika memenuhi syarat : 1. Stable (VxES, F(x)nS= 0 ) 2. Absorbant ( V x gs, F(x) n S /0