scientific article; zbMATH DE number 7144751

MaRDI QIDQ5206328zbMATH OpenFDO

Authors Tina Novak, Janez Žerovnik

Publication date 18 December 2019

zbMATH Keywords

cactus graphslinear algorithmindependent \(k\)-dominating set

Mathematics Subject Classification ID

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

Recommendations

• WEIGHTED DOMINATION NUMBER OF CACTUS GRAPHS
• Algorithmic results of independent \(k\)-domination on weighted graphs
• Weighted independent perfect domination on cocomparability graphs
• On the p-domination number of cactus graphs
• Independence-domination duality in weighted graphs
• A classification of cactus graphs according to their domination number
• Weighted domination of cocomparability graphs
• A classification of cactus graphs according to their total domination number
• Weighted domination on cocomparability graphs
• scientific article; zbMATH DE number 2544

Cited in

(6)

• A linear time algorithm for weighted \(k\)-fair domination problem in cactus graphs
• A linear algorithm for finding a minimum dominating set in a cactus
• A linear-time algorithm for minimum \(k\)-hop dominating set of a cactus graph
• \(k\)-domination on hexagonal cactus chains
• WEIGHTED DOMINATION NUMBER OF CACTUS GRAPHS
• Algorithmic results of independent \(k\)-domination on weighted graphs

This page was built for publication:

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