This paper demonstrates bounds on signed b-matching and b-edge cover numbers in strong product graphs, suggesting a connection to Gallai's theorem.
In this paper, we study the signed b-edge cover number and the signed b-matching number of a graph. Sharp bounds on these parameters of the strong product graphs are presented. We prove the existence of an analogue of Gallai's theorem relating maximum-size signed b-matchings and minimum-size signed b-edge covers for the complete graphs and complete bipartite graphs.
No takes yet. Share an insight, caveat, or question.
Changping Wang (2010) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: