Bipartite Domination Number of Mycielski Graph of Some Graph Families
Winelyn P. Pelias & Isagani S. Cabahug, Jr. · Asian Research Journal of Mathematics · 2023
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 number denoted by \(\gamma\)b...
Open access
Research Article
10.9734/arjom/2023/v19i5658