Abstract: Given a semigraph, we can construct graphs Sa, Sca, Se and S1e. In the same pattern, we construct bipartite graphs CA(S), A(S), VE(S), CA+(S) and A+(S). We find the equality of domination parameters in the bipartite graphs constructed with the domination and total domination parameters of the graphs Sa and Sca. We introduce the domination and independence parameters for the bipartite semigraph. We have defined Xachromatic number, Xa-hyperindependent number and Xa-irredundant number. Using these parameters, we have defined a Xa-dominating sequence chain.
DOI: *As the DOI is a unique identifier, it is already available in the pdf version. **The DOI link will be activated in the first midst of January 2026.