On well (edge) dominated and equimatchable strong product graphs
Combinatorics
2024-07-02 v1
Abstract
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 equimatchable strong product graphs of nontrivial graphs, and identify a large family of graphs whose strong products with any well-dominated graph are well-dominated.
Cite
@article{arxiv.2407.01121,
title = {On well (edge) dominated and equimatchable strong product graphs},
author = {Yixin Cao and Guiqiang Mou and Jianxin Wang},
journal= {arXiv preprint arXiv:2407.01121},
year = {2024}
}