Efficient (j, k)-dominating functions
From MaRDI portal
Publication:2107745
Recommendations
Cites work
- scientific article; zbMATH DE number 4085682 (Why is no real title available?)
- scientific article; zbMATH DE number 3557519 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- scientific article; zbMATH DE number 1792607 (Why is no real title available?)
- scientific article; zbMATH DE number 841590 (Why is no real title available?)
- scientific article; zbMATH DE number 1444486 (Why is no real title available?)
- scientific article; zbMATH DE number 975419 (Why is no real title available?)
- Characterizations of strongly chordal graphs
- Characterizations of totally balanced matrices
- Domination, independent domination, and duality in strongly chordal graphs
- Efficient (j,k)-domination
- Efficient dominating and edge dominating sets for graphs and hypergraphs
- Exact double domination in graphs
- Italian domination in trees
- Perfect Italian domination in trees
- Perfect codes in graphs
- Roman, Italian, and 2-domination
- The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
- The complexity of satisfiability problems
- The weighted perfect domination problem and its variants
Cited in
(3)
This page was built for publication: Efficient \((j, k)\)-dominating functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2107745)