$k$-Efficient partitions of graphs

DOI10.22049/cco.2019.26446.1112zbMath1438.05190OpenAlexW2921385611MaRDI QIDQ5242941

Mustapha Chellali, Stephen T. Hedetniemi, Teresa W. Haynes

Publication date: 8 November 2019

Full work available at URL: https://doaj.org/article/de35674b4c524468b35cb4cf3d2e55da

zbMATH Keywords

dominationefficient dominationdistance-\(k\) domination

Mathematics Subject Classification ID

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

Related Items (1)

k-Efficient domination: Algorithmic perspective

Cites Work

• Relations between packing and covering numbers of a tree
• Broadcasts in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: $k$-Efficient partitions of graphs