The following pages link to (Q4368728):
Displaying 50 items.
- On the difference of the domination number of a digraph and of its reverse (Q423949) (← links)
- On graphs for which the connected domination number is at most the total domination number (Q423952) (← links)
- A characterization of diameter-2-critical graphs with no antihole of length four (Q424139) (← links)
- Remoteness of permutation codes (Q427818) (← links)
- Efficient transformation of distance-2 self-stabilizing algorithms (Q433436) (← links)
- NP-completeness and APX-completeness of restrained domination in graphs (Q442103) (← links)
- A characterization of diameter-2-critical graphs whose complements are diamond-free (Q442211) (← links)
- Locating-total domination in graphs (Q442212) (← links)
- On the roman domination in the lexicographic product of graphs (Q442220) (← links)
- New results on 3-domination critical graphs (Q443927) (← links)
- Conical and spherical graphs (Q444416) (← links)
- Graphs with constant sum of domination and inverse domination numbers (Q446329) (← links)
- Fair domination in graphs (Q449132) (← links)
- A self-stabilizing algorithm for optimally efficient sets in graphs (Q456061) (← links)
- Algorithmic aspects of \(k\)-tuple total domination in graphs (Q456136) (← links)
- Locating-total domination in claw-free cubic graphs (Q456648) (← links)
- Upper bounds on the broadcast function using minimum dominating sets (Q456886) (← links)
- The domination game played on unions of graphs (Q468438) (← links)
- Graphs whose certain polynomials have few distinct roots (Q470526) (← links)
- Edge domination in some path and cycle related graphs (Q470539) (← links)
- Domination polynomials of \(k\)-tree related graphs (Q471790) (← links)
- On the number of optimal identifying codes in a twin-free graph (Q476309) (← links)
- The signed Roman \(k\)-domatic number of a graph (Q476316) (← links)
- Total domishold graphs: a generalization of threshold graphs, with connections to threshold hypergraphs (Q477326) (← links)
- An improved lower bound on the independence number of a graph (Q477342) (← links)
- Distance domination, guarding and covering of maximal outerplanar graphs (Q479016) (← links)
- Simultaneous domination in graphs (Q489305) (← links)
- 2-rainbow domination number of Cartesian products: \(C_{n}\square C_{3}\) and \(C_{n}\square C_{5}\) (Q489721) (← links)
- NP-hardness of multiple bondage in graphs (Q491093) (← links)
- Distance \(k\)-domination, distance \(k\)-guarding, and distance \(k\)-vertex cover of maximal outerplanar graphs (Q494436) (← links)
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets (Q494806) (← links)
- Bounds on locating total domination number of the Cartesian product of cycles and paths (Q495677) (← links)
- On a class of graphs between threshold and total domishold graphs (Q496435) (← links)
- Total version of the domination game (Q497340) (← links)
- On rainbow domination numbers of graphs (Q497921) (← links)
- Signed Roman domination in digraphs (Q498421) (← links)
- Four edge-grafting theorems on the reciprocal degree distance of graphs and their applications (Q498422) (← links)
- Progress on the Murty-Simon conjecture on diameter-2 critical graphs: a survey (Q498431) (← links)
- The Cartesian product of cycles with small 2-rainbow domination number (Q498440) (← links)
- On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size (Q499360) (← links)
- A theorem of Ore and self-stabilizing algorithms for disjoint minimal dominating sets (Q501004) (← links)
- Two subgraph grafting theorems on the energy of bipartite graphs (Q501270) (← links)
- Signed total Roman domination in digraphs (Q503685) (← links)
- Characterizing minimal point set dominating sets (Q504160) (← links)
- Dominating sequences in grid-like and toroidal graphs (Q504964) (← links)
- Exponential domination in subcubic graphs (Q504979) (← links)
- On the independence transversal total domination number of graphs (Q505424) (← links)
- Eternal domination: criticality and reachability (Q505466) (← links)
- (Total) domination in prisms (Q510330) (← links)
- Combinatorial bounds on connectivity for dominating sets in maximal outerplanar graphs (Q510554) (← links)
