An algorithm for the inverse distance-2 dominating set of a graph

DOI10.1007/978-3-030-01123-9_44MaRDI QIDQ3296826zbMATH OpenOpenAlexFDO

Authors

Publication date 2 July 2020

Published in Trends in Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-01123-9_44

zbMATH Keywords

inverse distance-2 domination number

Mathematics Subject Classification ID

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

Recommendations

• Inverse domination in graphs
• Inverse total domination in graphs
• scientific article; zbMATH DE number 2192114
• Bounds on the distance two-domination number of a graph
• Inverse dominating set in fuzzy graphs

Cites work

• R -Domination in Graphs
• Approximation algorithms for connected dominating sets
• Bounds on the distance two-domination number of a graph
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• Introduction to algorithms
• On the \(r\)-domination number of a graph
• Towards a theory of domination in graphs

Cited in

(2)

• Upper bounds for inverse domination in graphs
• Algorithms for secondary domination

This page was built for publication: An algorithm for the inverse distance-2 dominating set of a graph

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