Zobrazeno 1 - 1
of 1
pro vyhledávání: '"M.Goudar. Venkanagouda"'
Publikováno v:
International Mathematical Forum. 8:753-758
A set D . V [J(G)] is dominating set of jump graph, if every vertex not in D is adjacent to a vertex in D. The domination number of the jump graph is the minimum cardinality of dominating set of jump graph J(G). We also study the graph theoretic prop
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::954689dbeee1fe5b95b151963c8ee932
https://doi.org/10.12988/imf.2013.13079
https://doi.org/10.12988/imf.2013.13079
