Pages that link to "Item:Q2157841"
From MaRDI portal
The following pages link to Classification of efficient dominating sets of circulant graphs of degree 5 (Q2157841):
Displaying 9 items.
- The structure of graphs with circular flow number 5 or more, and the complexity of their recognition problem (Q286768) (← links)
- Efficient dominating sets in circulant graphs (Q526230) (← links)
- A randomized algorithm for determining dominating sets in graphs of maximum degree five (Q1034633) (← links)
- Weighted efficient domination problem on some perfect graphs (Q1348388) (← links)
- Existence of efficient total dominating sets of circulant graphs of degree 4 (Q2286605) (← links)
- A note on efficient domination in a superclass of \(P_5\)-free graphs (Q2446593) (← links)
- Semi Square Stable Graphs and Efficient Dominating Sets (Q5045998) (← links)
- Regular sets in circulant graphs with degree 3 (Q6611005) (← links)
- Perfect codes in 2-valent Cayley digraphs on abelian groups (Q6611023) (← links)