An Algorithm for the Inverse Distance-2 Dominating Set of a Graph

DOI10.1007/978-3-030-01123-9_44zbMath1442.05148OpenAlexW2911801344MaRDI QIDQ3296826

No author found.

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

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the \(r\)-domination number of a graph
• Approximation algorithms for connected dominating sets
• Bounds on the distance two-domination number of a graph
• R -Domination in Graphs
• Towards a theory of domination in graphs

This page was built for publication: An Algorithm for the Inverse Distance-2 Dominating Set of a Graph