• N.PRATAP BABU RAO
• SWETS.N

A dominating set of a jump graph J(G)= (V,E ) is a strong line dominating set if the induced sub graph < E-D > is complete. The strong non split line domination number ᵞ’ns(J(G)) of J(G) is minimum cardinality of a strong non split line dominating set. In this paper we relate this parameter to the parameters of jump graph J(G) and obtain its exact values for some standard graphs.

Dominating set of a jump graph, split line domination, non split line domination

"THE STRONG NON SPLIT LINE DOMINATION OF A JUMP GRAPH", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.5, Issue 12, page no.439-443, December-2018, Available :http://www.jetir.org/papers/JETIR1812660.pdf

"THE STRONG NON SPLIT LINE DOMINATION OF A JUMP GRAPH", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.5, Issue 12, page no. pp439-443, December-2018, Available at : http://www.jetir.org/papers/JETIR1812660.pdf