Pages that link to "Item:Q1865157"
From MaRDI portal
The following pages link to Bounds on the distance two-domination number of a graph (Q1865157):
Displaying 13 items.
- Distance domination, guarding and covering of maximal outerplanar graphs (Q479016) (← links)
- Probabilistic analysis of upper bounds for 2-connected distance \(k\)-dominating sets in graphs (Q837173) (← links)
- Distance domination of generalized de Bruijn and Kautz digraphs (Q1692700) (← links)
- Bounds on the 2-domination number (Q1744236) (← links)
- Secondary and internal distances of sets in graphs. II (Q1928636) (← links)
- Some new results on distance \(k\)-domination in graphs (Q2248720) (← links)
- Distance-2 domatic numbers of grid graphs (Q2799858) (← links)
- Graphs with equal domination and 2-distance domination numbers (Q3089361) (← links)
- An Algorithm for the Inverse Distance-2 Dominating Set of a Graph (Q3296826) (← links)
- A remark on the (2,2)-domination number (Q3606460) (← links)
- On disjunctive domination in graphs (Q5221839) (← links)
- Graph Domination in Distance Two (Q5316266) (← links)
- Eternal distance-\(k\) domination on graphs (Q6108933) (← links)