Pages that link to "Item:Q2372879"
From MaRDI portal
The following pages link to Distance domination and distance irredundance in graphs (Q2372879):
Displaying 15 items.
- Distance domination versus iterated domination (Q442389) (← links)
- Exponential domination in subcubic graphs (Q504979) (← links)
- Bounds on the exponential domination number (Q729783) (← links)
- Distance irredundance and connected domination numbers of a graph (Q860459) (← links)
- A linear-time algorithm for minimum \(k\)-hop dominating set of a cactus graph (Q2166266) (← links)
- Domination on hyperbolic graphs (Q2198410) (← links)
- Distance domination in graphs with given minimum and maximum degree (Q2410104) (← links)
- Connected Domination (Q3384607) (← links)
- The ratio of the distance irredundance and domination numbers of a graph (Q4277983) (← links)
- (Q4378634) (← links)
- (Q4848783) (← links)
- On the distance domination number of bipartite graphs (Q4958000) (← links)
- Higher Independence Complexes of graphs and their homotopy types (Q5003757) (← links)
- $k$-distance enclaveless number of a graph (Q5102423) (← links)
- Graph Domination in Distance Two (Q5316266) (← links)