Bipartite Domination Number of Mycielski Graph of Some Graph Families
Winelyn P. Pelias, Isagani S. Cabahug, Jr.
Asian Research Journal of Mathematics · pp. 41–50 · Published 24 Mar 2023
10.9734/arjom/2023/v19i5658Abstract
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\)bip(G) of graph G is the minimum cardinality of a bipartite dominating set G. In this paper, we determine the exact bipartite domination number of a crown graph and its mycielski graph as well as the bipartite domination number of the mycielski graph of path and cycle graphs.
Cited by 3
Bhawani Sankar Panda, Subhasmita Joshi, Dalu Jacob · Lecture Notes in Computer Science · 2025
Suha Wazzan, Hanan Ahmed · Symmetry · 2023
Showing 2 of 3 known citations — external sources report more than can currently be individually listed.
Related research
- Bipartite Domination in Some Classes of Graphs — shares topic coverage
Article metrics
Real usage data collected on this platform.
0
Page views
0
PDF downloads
0
Outbound clicks
3
Citations
Views by country
Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".
No views recorded yet.
Traffic sources
Referring site, by host.
No traffic recorded yet.
Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.