Some Domination Parameters in Generalized Jahangir Graph \(J_{n,m}\)
Mtarneh, S., Hasni, R., Akhbari, M. H., and Movahedi, F.
Corresponding Email: [email protected]
Received date: -
Accepted date: -
Abstract:
Given a graph \(G=(V,E)\), a dominating set \(D\) is a subset of vertex set \(V\) such that any vertex not in \(D\) is adjacent to at least one vertex in \(D\). The domination number of a graph \(G\) is the minimum size of the dominating sets of \(G\). In this paper, we investigate some domination parameters such as domination number, total domination, independent domination, connected domination, 2-domination, outer-connected domination and doubly connected domination number for a generalized Jahangir graph \(J_{n,m}\).
Keywords: Jahangir graph, Domination number, Total domination, Independent domination, 2-domination, Connected domination, Outer-connected domination, Doubly connected domination