|
|
|
|
Maple Procedure for Calculate of Dominating Set
|
|
|
|
|
|
|
|
نویسنده
|
matinfar M ,mirzamani S
|
|
منبع
|
تحقيق در عمليات در كاربردهاي آن - دانشگاه آزاد اسلامي لاهيجان - 1387 - دوره : 5 - شماره : 19 - صفحه:43 -45
|
|
چکیده
|
Let g is n- vertex graph. in 1996, reed conjectured that for every connected3- regular g. in this paper, we introduce an algorithm in computer algebra system of m aplesuch that, by using any graph as input, we can calculate domination number y(g) and illustratedset of all dominating sets. it important that these sets choose among between sets.
|
|
کلیدواژه
|
Minimum Dominating Set ,(MDS) ,Maple ,Adjacency Matrix
|
|
آدرس
|
university of mazandaran, faculty of basic sciences, department of mthematics, ایران, university of mazandaran, faculty of basic sciences, department of mathematics, ایران
|
|
پست الکترونیکی
|
m.matinfar@umz.ac.ir
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|