BILANGAN DOMINASI DAN BILANGAN KEBEBASAN GRAF BIPARTIT KUBIK

Article Metrics: (Click on the Metric tab below to see the detail)

Article Info
Submitted: 14-05-2013
Published: 14-05-2013
Section: Articles
Fulltext PDF Tell your colleagues Email the author

Let a graph , is a pair of sets V vertices and set E edges. Let  be a subset of . If each vertex of  is adjacent to atleast one vertex of , then  is called a dominating set in . The domination number of a graph  denoted as  is the minimum cardinality of a dominating set in . A set of vertices in a graph is said to be an independent set if no two vertices in the set are adjacent. the number of vertices in the largest independent set of a graph  is called the independence number and denoted by . In this final project, we consider the relation between independent set and dominating set of finite simple graphs. In particular, discuss them for some cubic bipartite graphs and find that the domination number is less than  of the number of vertices and independence number  is half of the number of vertices.

 

  1. Budi Santoso 

    JURNAL MATEMATIKA terbit tiga kali setahun (April, Agustus, Desember), menerima artikel ilmiah dalam bidang matematika, statistika, dan ilmu komputer. Terbit sejak tahun 1998 dengan nama JURNAL MATEMATIKA DAN KOMPUTER dengan warna dasar sampul kuning dan warna tulisan hitam. Mulai tahun 2005 nama jurnal berubah menjadi JURNAL MATEMATIKA dengan warna dasar sampul kuning gading dan warna tulisan merah maron.

  2. Djuwandi Djuwandi 
  3. Robertus Heri S.U