NUR ENDAH, SUKMAWATI (2005) *TRANSITIF KLOSUR DARI GABUNGAN DUA RELASI EKUIVALENSI PADA SUATU HIMPUNAN DENGAN STRUKTUR DATA DINAMIS.* Jurnal Matematika, 8 (3). pp. 78-87. ISSN 1410-8518

| PDF 128Kb |

## Abstract

A relation R on set A is an equivalence relation on A if and only if R is reflexive, symmetric and transitive. If two equivalence relations on set A are combined, the combination of them is not surely an equivalence relation, because it is not surely transitive relation. In this paper is found the smallest transitive relation (transitive closure) of the combination, to be an equivalence relation. Then the steps to determine transitive closure are programmed in Pascal programming language with dynamic data structure that is multilist.

Item Type: | Article |
---|---|

Uncontrolled Keywords: | transitive closure, equivalence relation, dynamic data structure |

Subjects: | Q Science > QA Mathematics |

Divisions: | Faculty of Science and Mathematics > Department of Mathematics |

ID Code: | 2083 |

Deposited By: | Admin Departemen Matematika |

Deposited On: | 02 Dec 2009 15:33 |

Last Modified: | 23 Dec 2009 14:42 |

Repository Staff Only: item control page