On well (edge) dominated and equimatchable strong product graphs

Yixin Cao, Guiqiang Mou, Jianxin Wang

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…