Graphs with small and large hop domination numbers

DOI10.7251/BIMVI2103483AMaRDI QIDQ5865079zbMATH OpenFDO

Authors

Publication date 10 June 2022

zbMATH Keywords

distancedomination numberhop domination number

Mathematics Subject Classification ID

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

Recommendations

• Hop domination in graphs. II
• Bounds on the hop domination number of a tree
• On 2-step and hop dominating sets in graphs
• On hop domination number of some generalized graph structures
• Locating-hop domination in graphs

Cited in

(15)

• Graphs with large hop Roman domination number
• Certified hop domination in graphs
• Locating-hop domination in graphs
• Hop domination in graphs. II
• Non split hop domination number for some mirror graphs and Cartesian product of two distinct paths
• Total hop dominating sets in the join, corona and lexicographic product of graphs
• On hop domination number of some generalized graph structures
• Further results on the hop domination number of a graph
• Double hop dominating sets in graphs
• Bounds on the hop domination number of a tree
• Hop domination polynomial of graphs
• Clone hop domination number of a graph
• On total domination and hop domination in diamond-free graphs
• On 2-step and hop dominating sets in graphs
• Domination number of jump graph

This page was built for publication: Graphs with small and large hop domination numbers

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