The minimum dominating tree problem for graphs

MaRDI QIDQ2927178zbMATH OpenFDO

Authors Hao Lin, Lan Lin

Publication date 3 November 2014

Published in Chinese Quarterly Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

network optimizationexact evaluationspecial graphsminimum dominating tree

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• scientific article; zbMATH DE number 3918387
• scientific article; zbMATH DE number 2192152
• On the Algorithmic Complexity of Total Domination
• scientific article; zbMATH DE number 1052836
• On minimum dominating sets with minimum intersection

Cited in

(9)

• scientific article; zbMATH DE number 3918387 (Why is no real title available?)
• scientific article; zbMATH DE number 30748 (Why is no real title available?)
• Minimum weight clustered dominating tree problem
• Minimum monopoly in regular and tree graphs
• Tree search algorithms for the dominating vertex set problem
• Minimum-cost b-edge dominating sets on trees
• Reconfiguring minimum dominating sets: the -graph of a tree
• Models for minimum cost dominating trees
• An exact solution framework for the minimum cost dominating tree problem

This page was built for publication: The minimum dominating tree problem for graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2927178)