|
|
|
|
Counting the number of weakly connected dominating sets of graphs
|
|
|
|
|
|
|
|
نویسنده
|
alikhani s. ,jahari s. ,mehryar m.
|
|
منبع
|
malaysian journal of mathematical sciences - 2016 - دوره : 10 - شماره : 3 - صفحه:297 -306
|
|
چکیده
|
Let g = (v (g);e(g)) be a simple graph. a non-empty set s⊆v (g) is a weakly connected dominating set in g,if the subgraph obtained from g by removing all edges each joining any two vertices in v (g)ns is connected. in this paper,we consider some graphs and study the number of their weakly connected dominating sets.
|
|
کلیدواژه
|
Cycle; Dominating sets; Path; Weakly connected
|
|
آدرس
|
department of mathematics,yazd university, ایران, department of mathematics,yazd university, ایران, department of mathematics,yazd university, ایران
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|