Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Winelyn P. Pelias"'
Autor:
Winelyn P. Pelias, Isagani S. Cabahug
Publikováno v:
Asian Research Journal of Mathematics. 19:41-50
For a nontrivial connected graph G, a non-empty set S \(\subseteq\) V (G) is a bipartite dominating set of graph G, if the subgraph G[S] induced by S is bipartite and for every vertex not in S is dominated by any vertex in S. The bipartite domination
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::af69b6d4502d5d809d5b04cd3da5b722
https://doi.org/10.9734/arjom/2023/v19i5658
https://doi.org/10.9734/arjom/2023/v19i5658
Publikováno v:
Asian Research Journal of Mathematics. 19:8-17
For a nontrivial connected graph G, a non-empty set S \(\subseteq\) V (G) is a bipartite dominating set of graph G, if the subgraph G[S] induced by S is bipartite and for every vertex not in S is dominated by any vertex in S. The bipartite domination
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c192b14602da0226e51d924b2e5fd362
https://doi.org/10.9734/arjom/2023/v19i3645
https://doi.org/10.9734/arjom/2023/v19i3645