Efficient (j, k)-dominating functions
DOI10.7151/DMGT.2355zbMATH Open1504.05218OpenAlexW3086793159MaRDI QIDQ2107745FDOQ2107745
Authors: William F. Klostermeyer, Gary MacGillivray, Saeed Mohammadian Semnani, Farzaneh Piri 
Publication date: 2 December 2022
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2355
Recommendations
treecomplexitystrongly chordal graphefficient dominating set\(k\)-tuple dominating setefficient \((j, k)\)-dominating function
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Perfect codes in graphs
- Title not available (Why is that?)
- The complexity of satisfiability problems
- Characterizations of strongly chordal graphs
- Characterizations of totally balanced matrices
- Title not available (Why is that?)
- Domination, independent domination, and duality in strongly chordal graphs
- The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- The weighted perfect domination problem and its variants
- Efficient (j,k)-domination
- Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs
- Title not available (Why is that?)
- Italian domination in trees
- Exact double domination in graphs
- Perfect Italian domination in trees
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (2)
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)
