New Parameters on Inverse Domination
摘要
A set D of vertices in a graph G(V, E) is a dominating set of G, if every vertex of V not in D is adjacent to at least one vertex in D. A dominating set D of G(V, E)is a k – fair dominating set of G, for 𝑘 ≥ 1 if every vertex in V – D is adjacent to exactly k vertices in D. The k – fair domination number 𝛾𝑘𝑓𝑑(𝐺) of G is the minimum cardinality of a k – fair dominating set. In this article, we define the inverse of the k – fair domination number and try to find it for some class of graphs.
引用本文（GB/T 7714）
T G Jayasree, Radha Rajamani Iyer. New Parameters on Inverse Domination[J]. SSRN Electronic Journal, 2019.
引文网络
本站仅收录题录与摘要供学习参考，全文版权归属出版方；如有侵权请联系我们删除。