Title of article
independent domination in directed graphs
Author/Authors
cary, michael west virginia university - division of resource economics and management, morgantown, usa , cary, jonathan virginia commonwealth university - department of mathematics, richmond, usa , prabhu, savari sri venkateswara college of engineering - department of mathematics, sriperumbudur, india
From page
67
To page
80
Abstract
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.
Keywords
dominating set , independent set , independent domination , independent dominating set , idomatic number
Journal title
Communications in Combinatorics and Optimization
Journal title
Communications in Combinatorics and Optimization
Record number
2704765
Link To Document