Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Leocint F. Consistente"'
Publikováno v:
Asian Research Journal of Mathematics. :25-34
set S of vertices in a graph G = (V (G);E(G)) is a hinge dominating set if every vertex \(u\) \(\in\) V \(\setminus \) \(S\) is adjacent to some vertex \(u\) \(\in\) \(S\) and a vertex \(w\) \(\in\) V \(\setminus\) \(S\) such that (\(v\), \(w\)) is n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d56ff4a60ed83f49f0478829859ae497
https://doi.org/10.9734/arjom/2022/v18i930404
https://doi.org/10.9734/arjom/2022/v18i930404
