13.05.2018 Views

merged

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Domination Subdivision Number in Some graphs<br />

Aisyah Kimiko Binti Mohd Azlan<br />

Supervisor: Assoc. Prof. Dr. Roslan Bin Hasni<br />

Bachelor of Science (Computational Mathematics)<br />

School of Informatics and Applied Mathematics<br />

A set S of vertices of a graph G = (V, E) is a dominating set if every vertex of V(G)/ S<br />

is adjacent to some vertex in S. The domination number is the minimum cardinality of a<br />

dominating set of G. The domination subdivision number of G is the minimum number of<br />

edges that must be subdivided (where each edge in G can be subdivided at most once)<br />

in order to increase the domination number. In this project, we will investigate the<br />

concept of domination number and domination subdivision number for some standard<br />

graphs including path, cycle, tree and star.<br />

913 | UMT UNDERGRADUATE RESEARCH DAY 2018

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!