Back close

Results on the inverse domination number of some class of graphs

Publication Type : Journal Article

Publisher : International Journal of Mechanical Engineering and Technology

Source : International Journal of Mechanical Engineering and Technology, IAEME Publication, Volume 9, Number 1, p.995-1004 (2018)

Url : https://www.iaeme.com/MasterAdmin/uploadfolder/IJMET_09_01_106/IJMET_09_01_106.pdf

Keywords : Dominating sets, Domination number, Inverse Domination number

Campus : Coimbatore

School : School of Engineering

Department : Mathematics

Year : 2018

Abstract : 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. Let D be a minimum dominating set of G. If V – D contains a dominating set say D’ is called an inverse dominating set with respect to D. The inverse domination number γ’(G) of G is the order of a smallest inverse dominating set of G. In this paper we establish inverse domination number for some families of graphs. © IAEME Publication.

Cite this Research Publication : T. G. Jayasree and Dr. Radha Iyer R., “Results on the inverse domination number of some class of graphs”, International Journal of Mechanical Engineering and Technology, vol. 9, 995 vol., pp. 995-1004, 2018.

Admissions Apply Now