Efficient \((j, k)\)-dominating functions

DOI10.7151/dmgt.2355zbMath1504.05218OpenAlexW3086793159MaRDI QIDQ2107745

Farzaneh Piri, William F. Klostermeyer, Saeed Mohammadian Semnani, Gary MacGillivray

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

zbMATH Keywords

treecomplexityefficient dominating setstrongly chordal graph\(k\)-tuple dominating setefficient \((j, k)\)-dominating function

Mathematics Subject Classification ID

Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Italian domination in trees
• Domination, independent domination, and duality in strongly chordal graphs
• Characterizations of strongly chordal graphs
• Perfect Italian domination in trees
• The weighted perfect domination problem and its variants
• Perfect codes in graphs
• Characterizations of totally balanced matrices
• Efficient (j,k)-domination
• The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
• Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs
• The complexity of satisfiability problems
• Exact double domination in graphs

This page was built for publication: Efficient \((j, k)\)-dominating functions