Efficient dominating sets and perfect dominating sets of circulant graphs and unicyclic graphs
From MaRDI portal
Publication:3374664
Recommendations
Cited In (6)
- SSP-cyclic structure of some circulant graphs
- Partially balanced incomplete block designs arising from minimum efficient dominating sets of a graph
- Efficient dominating sets in circulant graphs
- Classification of efficient dominating sets of circulant graphs of degree 5
- Efficient domination in circulant graphs
- Efficient domination in Mycielski's graphs
This page was built for publication: Efficient dominating sets and perfect dominating sets of circulant graphs and unicyclic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3374664)