Relationship between optimal k-distance dominating sets in a weighted graph and its spanning trees

DOI10.1016/J.IPL.2019.02.002MaRDI QIDQ2414036zbMATH OpenOpenAlexWikidataFDO

Authors Kundu Sukhamay

Publication date 10 May 2019

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2019.02.002

zbMATH Keywords

\(k\)-distance dominating setgraph algorithmsspanning treeweighted graph

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• A generalized linear time algorithm for an optimal \(k\)-distance dominating set of a weighted tree
• scientific article; zbMATH DE number 5732600
• scientific article; zbMATH DE number 1744092
• Lower bound on the distance k-domination number of a tree
• A distributed algorithm for minimum distance-k domination in trees

Cites work

• A linear time algorithm for optimal \(k\)-hop dominating set of a tree
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)

Cited in

(2)

• A generalized linear time algorithm for an optimal \(k\)-distance dominating set of a weighted tree
• A heuristic approximation algorithm of minimum dominating set based on rough set theory

This page was built for publication: Relationship between optimal \(k\)-distance dominating sets in a weighted graph and its spanning trees

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