Graphs with small and large hop domination numbers
From MaRDI portal
Publication:5865079
DOI10.7251/BIMVI2103483AzbMATH Open1499.05177MaRDI QIDQ5865079FDOQ5865079
Authors:
Publication date: 10 June 2022
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distance in graphs (05C12)
Cited In (15)
- Certified hop domination in graphs
- Graphs with large hop Roman domination number
- 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
- Hop domination polynomial of graphs
- Clone hop domination number of a graph
- Bounds on the hop domination number of a tree
- 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)
