The following pages link to (Q4368729):
Displaying 50 items.
- On the distribution of the domination number for random class cover catch digraphs (Q158221) (← links)
- Trees with 2-reinforcement number three (Q263026) (← links)
- Disjunctive total domination in graphs (Q266033) (← links)
- Weighted restrained domination in subclasses of planar graphs (Q278718) (← links)
- Computing Roman domatic number of graphs (Q284340) (← links)
- (Total) vector domination for graphs with bounded branchwidth (Q290105) (← links)
- Signed Roman \(k\)-domination in digraphs (Q293661) (← links)
- Edge criticality in graph domination (Q295267) (← links)
- Isolate domination in graphs (Q296201) (← links)
- Total and paired domination numbers of \(C_m\) bundles over a cycle \(C_n\) (Q306109) (← links)
- Locating-total dominating sets in twin-free graphs: a conjecture (Q311495) (← links)
- Signed total Roman domination in graphs (Q326484) (← links)
- The independent transversal dombondage number of a graph (Q327649) (← links)
- Domination in graphoidally covered graphs: least-kernel graphoidal covers (Q327691) (← links)
- Signed mixed Roman domination numbers in graphs (Q328725) (← links)
- Location-domination in line graphs (Q329538) (← links)
- Maximal 2-rainbow domination number of a graph (Q334128) (← links)
- Liar's dominating sets in graphs (Q335352) (← links)
- Exact and approximate algorithms for movement problems on (special classes of) graphs (Q338392) (← links)
- A note on non-dominating set partitions in graphs (Q339496) (← links)
- A characterization of locally semicomplete CKI-digraphs (Q343738) (← links)
- On the rainbow domination number of digraphs (Q343745) (← links)
- Algorithmic aspects of open neighborhood location-domination in graphs (Q344871) (← links)
- On dominator colorings in graphs (Q351043) (← links)
- \(H\)-kernels in infinite digraphs (Q354449) (← links)
- An upper bound for the total restrained domination number of graphs (Q367057) (← links)
- Coloring, location and domination of corona graphs (Q372395) (← links)
- On the ratio between 2-domination and total outer-independent domination numbers of trees (Q379903) (← links)
- Domination versus independent domination in cubic graphs (Q385388) (← links)
- Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs (Q386432) (← links)
- Upper bounds on the signed (\(k, k\))-domatic number (Q387615) (← links)
- Dominating functions and total dominating functions of countable graphs (Q389474) (← links)
- Parameterized complexity of max-lifetime target coverage in wireless sensor networks (Q391780) (← links)
- Relating the annihilation number and the 2-domination number of a tree (Q394342) (← links)
- On the algorithmic complexity of \(k\)-tuple total domination (Q400524) (← links)
- Domination and total domination in cubic graphs of large girth (Q400535) (← links)
- \([1,2]\)-domination in graphs (Q401141) (← links)
- Total transversals and total domination in uniform hypergraphs (Q405218) (← links)
- Total restrained domination in graphs of diameter 2 or 3 (Q405425) (← links)
- Improved bounds on the domination number of a tree (Q406327) (← links)
- Total restrained domination in claw-free graphs with minimum degree at least two (Q411852) (← links)
- On the complexity of the bondage and reinforcement problems (Q413470) (← links)
- Directed domination in oriented graphs (Q423913) (← links)
- Multiple factor Nordhaus-Gaddum type results for domination and total domination (Q423926) (← links)
- On \(\alpha\)-total domination in graphs (Q423927) (← links)
- NP-completeness and APX-completeness of restrained domination in graphs (Q442103) (← links)
- On the roman domination in the lexicographic product of graphs (Q442220) (← links)
- New results on 3-domination critical graphs (Q443927) (← links)
- On the \((h,k)\)-domination numbers of iterated line digraphs (Q444453) (← links)
- Efficient total domination in digraphs (Q450576) (← links)
