Pages that link to "Item:Q659765"
From MaRDI portal
The following pages link to \(k\)-domination and \(k\)-independence in graphs: A survey (Q659765):
Displaying 26 items.
- Trees with 2-reinforcement number three (Q263026) (← links)
- The difference between the metric dimension and the determining number of a graph (Q298637) (← links)
- On the complexity of reinforcement in graphs (Q339476) (← links)
- Algorithmic and structural aspects of the \(P_3\)-Radon number (Q363552) (← links)
- Relating the annihilation number and the 2-domination number of a tree (Q394342) (← links)
- On the \(k\)-residue of disjoint unions of graphs with applications to \(k\)-independence (Q394539) (← links)
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- Trees with maximum \(p\)-reinforcement number (Q401133) (← links)
- An upper bound on the \(P_3\)-Radon number (Q442343) (← links)
- Upper bounds on the \(k\)-forcing number of a graph (Q479006) (← links)
- NP-hardness of multiple bondage in graphs (Q491093) (← links)
- A new generalization of kernels in digraphs (Q516902) (← links)
- Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture (Q526243) (← links)
- Bounds on weak Roman and 2-rainbow domination numbers (Q741531) (← links)
- Independent \((k + 1)\)-domination in \(k\)-trees (Q777366) (← links)
- On the signed (total) \(k\)-independence number in graphs (Q891311) (← links)
- On approximating (connected) 2-edge dominating set by a tree (Q1635808) (← links)
- Making a dominating set of a graph connected (Q1656909) (← links)
- Client-server and cost effective sets in graphs (Q1713579) (← links)
- Bounds on the 2-domination number (Q1744236) (← links)
- Constructing dominating sets in circulant graphs (Q1745909) (← links)
- Algorithm to find a maximum 2-packing set in a cactus (Q1748991) (← links)
- Grundy dominating sequences and zero forcing sets (Q1751247) (← links)
- On the \(k\)-domination number of digraphs (Q2331578) (← links)
- 2-edge connected dominating sets and 2-connected dominating sets of a graph (Q5963646) (← links)
- Bounds on the Twin-Width of Product Graphs (Q6131799) (← links)
