Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Mou, Guiqiang"'
A graph is well-(edge-)dominated if every minimal (edge) dominating set is minimum. A graph is equimatchable if every maximal matching is maximum. We study these concepts on strong product graphs. We fully characterize well-edge-dominated and equimat
Externí odkaz:
http://arxiv.org/abs/2407.01121
