BILANGAN DOMINASI PERSEKITARAN PADA GRAF LENGKAP DAN GRAF BIPARTIT LENGKAP

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

Article Info
Submitted: 20-07-2017
Published: 20-04-2017
Section: Articles
Fulltext PDF Tell your colleagues Email the author

Given graph  with set of vertex  and set of edge E. Set  subset of  is called domination set if every point in  is adjacent with at least one point in  in graph . The minimum cardinality of all set of domination graph  is called domination number. Let  be a subset of , set  is called a neighborhood set if  with   induced subgraph  of . The minimum cardinality of all the neighborhood set of graph  is called the neighborhood number. There are several types of neighborhood domination number depending on the parameters. In this paper we examine the transversal neighborhood domination number and global neighborhood domination number in complete graph and complete bipartite graph.

  1. Lucia Ratnasari 

    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. Bayu Surarso 
  3. Harjito Harjito 
  4. Uun Maunah