Pages that link to "Item:Q659765"
From MaRDI portal
The following pages link to \(k\)-domination and \(k\)-independence in graphs: A survey (Q659765):
Displayed 23 items.
- Trees with 2-reinforcement number three (Q263026) (← links)
- The difference between the metric dimension and the determining number of a graph (Q298637) (← 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)
- Bounds on weak Roman and 2-rainbow domination numbers (Q741531) (← links)
- On the signed (total) \(k\)-independence number in graphs (Q891311) (← links)
- On bondage numbers of graphs: a survey with some comments (Q1953664) (← links)
- On the \(p\)-reinforcement and the complexity (Q2253958) (← links)
- On general frameworks and threshold functions for multiple domination (Q2352076) (← links)
- On upper bounds for multiple domination numbers of graphs (Q2444571) (← links)
- On \(k\)-domination and \(j\)-independence in graphs (Q2446328) (← links)
- Algorithmic aspects of the \(k\)-domination problem in graphs (Q2446334) (← links)
- Partitions of graphs into small and large sets (Q2446835) (← links)
- The p-domination number of complete multipartite graphs (Q2931929) (← links)
- Distinguished Minimal Topological Lassos (Q5265017) (← links)
- On Approximating (Connected) 2-Edge Dominating Set by a Tree (Q5740184) (← links)
- 2-edge connected dominating sets and 2-connected dominating sets of a graph (Q5963646) (← links)