|
|
|
|
independent domination in directed graphs
|
|
|
|
|
|
|
|
نویسنده
|
cary michael ,cary jonathan ,prabhu savari
|
|
منبع
|
communications in combinatorics and optimization - 2021 - دوره : 6 - شماره : 1 - صفحه:67 -80
|
|
چکیده
|
In this paper we initialize the study of independent domination in directed graphs. we show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. we then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, trees, dags, cycles, and bipartite graphs. we also provide the idomatic number for special cases of some of these families of digraphs.
|
|
کلیدواژه
|
dominating set ,independent set ,independent domination ,independent dominating set ,idomatic number
|
|
آدرس
|
west virginia university, division of resource economics and management, usa, virginia commonwealth university, department of mathematics, usa, sri venkateswara college of engineering, department of mathematics, india
|
|
پست الکترونیکی
|
drsavariprabhu@gmail.com
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|