The following pages link to (Q4368728):
Displaying 50 items.
- Complexity properties of complementary prisms (Q511681) (← links)
- Roman game domination number of a graph (Q511720) (← links)
- Bounds on the independence number of a graph in terms of order, size and maximum degree (Q516816) (← links)
- The \(k\)-rainbow reinforcement numbers in graphs (Q516871) (← links)
- Total domination in maximal outerplanar graphs (Q516883) (← links)
- Italian domination in trees (Q516889) (← links)
- A survey and classification of Sierpiński-type graphs (Q516890) (← links)
- Graphs that are simultaneously efficient open domination and efficient closed domination graphs (Q516892) (← links)
- A note on \(\alpha\)-total domination in cubic graphs (Q516909) (← links)
- Some comments on the Slater number (Q526227) (← links)
- Domination number and minimum dominating sets in pseudofractal scale-free web and Sierpiński graph (Q526869) (← links)
- The algorithmic complexity of mixed domination in graphs (Q533883) (← links)
- Bounds on the locating-total domination number of a tree (Q534338) (← links)
- Upper bounds on the signed total domatic number of graphs (Q534350) (← links)
- Capacitated domination problem (Q534769) (← links)
- Kernels by monochromatic paths in digraphs with covering number 2 (Q539857) (← links)
- On the existence of \(k\)-partite or \(K_p\)-free total domination edge-critical graphs (Q539864) (← links)
- Maximal independent sets in minimum colorings (Q539867) (← links)
- Broadcasts and domination in trees (Q539885) (← links)
- Some notes on domination edge critical graphs (Q544890) (← links)
- An extremal problem for total domination stable graphs upon edge removal (Q548282) (← links)
- Total domination dot-stable graphs (Q548284) (← links)
- Nordhaus-Gaddum bounds on the \(k\)-rainbow domatic number of a graph (Q550486) (← links)
- Extremal energies of trees with a given domination number (Q550612) (← links)
- On average lower independence and domination numbers in graphs (Q556830) (← links)
- A lower bound for the CO-irredundance number of a graph (Q556836) (← links)
- Paired-domination in inflated graphs (Q596115) (← links)
- Self-stabilizing algorithms for minimal dominating sets and maximal independent sets (Q597323) (← links)
- Total domination critical and stable graphs upon edge removal (Q602674) (← links)
- Disjoint dominating and total dominating sets in graphs (Q602677) (← links)
- Paired-domination in subdivided star-free graphs (Q604650) (← links)
- Bounds on the total restrained domination number of a graph (Q604651) (← links)
- Total domination stable graphs upon edge addition (Q607001) (← links)
- Graphs with disjoint dominating and paired-dominating sets (Q607427) (← links)
- Bounds on the connected \(k\)-domination number in graphs (Q608255) (← links)
- Bounds on the signed domatic number (Q609986) (← links)
- Total domination dot-critical graphs (Q617644) (← links)
- On the existence problem of the total domination vertex critical graphs (Q617898) (← links)
- Loose cover of graphs (Q626957) (← links)
- The domination numbers of cylindrical grid graphs (Q627140) (← links)
- A lower bound on the total outer-independent domination number of a tree (Q627257) (← links)
- Global secure sets of grid-like graphs (Q628346) (← links)
- Branch and recharge: exact algorithms for generalized domination (Q639293) (← links)
- Dominating sets, packings, and the maximum degree (Q641164) (← links)
- On the existence of total dominating subgraphs with a prescribed additive hereditary property (Q641172) (← links)
- A note on total reinforcement in graphs (Q642968) (← links)
- Total domination changing and stable graphs upon vertex removal (Q642980) (← links)
- Transversals and domination in uniform hypergraphs (Q649007) (← links)
- An upper bound on the 2-outer-independent domination number of a tree (Q650849) (← links)
- Towards a new framework for domination (Q651449) (← links)
