An algorithm for prescribed multiple domination in arbitrary graphs

DOI10.1016/S0898-1221(98)00049-2zbMath0999.05094OpenAlexW2040316892MaRDI QIDQ1608446

R. Smith

Publication date: 6 August 2002

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0898-1221(98)00049-2

zbMATH Keywords

dominationbacktracking algorithm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bibliography on domination in graphs and some basic definitions of domination parameters
• A note on total domination
• Parallel concepts in graph theory
• Total domination in graphs

This page was built for publication: An algorithm for prescribed multiple domination in arbitrary graphs