The following pages link to The bondage number of a graph (Q1174124):
Displaying 50 items.
- The bondage number of random graphs (Q281604) (← links)
- Edge criticality in graph domination (Q295267) (← links)
- Minimum edge blocker dominating set problem (Q319914) (← links)
- The independent transversal dombondage number of a graph (Q327649) (← links)
- On the bondage number of middle graphs (Q358187) (← links)
- Upper bounds for the bondage number of graphs on topological surfaces (Q385372) (← links)
- The \(k\)-rainbow bondage number of a graph (Q400538) (← links)
- On the complexity of the bondage and reinforcement problems (Q413470) (← links)
- An improved upper bound for the bondage number of graphs on surfaces (Q449115) (← links)
- Blockers for the stability number and the chromatic number (Q489343) (← links)
- NP-hardness of multiple bondage in graphs (Q491093) (← links)
- The \(p\)-bondage number of trees (Q659674) (← links)
- On the Roman bondage number of planar graphs (Q659719) (← links)
- Bondage number of mesh networks (Q692637) (← links)
- The total bondage number of grid graphs (Q714029) (← links)
- Non-isolating bondage in graphs (Q726514) (← links)
- Bondage numbers of Mycielski graphs (Q726515) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- On the bondage, strong and weak bondage numbers in complementary prism graphs (Q821325) (← links)
- Transferable domination number of graphs (Q833006) (← links)
- Bondage number of strong product of two paths (Q893339) (← links)
- The bondage number in complete \(t\)-partite digraphs (Q989552) (← links)
- Restrained bondage in graphs (Q998423) (← links)
- Paired bondage in trees (Q998438) (← links)
- Reinforcement numbers of digraphs (Q1026162) (← links)
- On the bondage number of a graph (Q1126221) (← links)
- The discipline number of a graph (Q1174136) (← links)
- A bound on the size of a graph with given order and bondage number (Q1292849) (← links)
- A counterexample to a conjecture on the bondage number of a graph (Q1313887) (← links)
- Bounds on the bondage number of a graph (Q1322182) (← links)
- The bondage and reinforcement numbers of \(\gamma_ f\) for some graphs (Q1356465) (← links)
- New results about the bondage number of a graph (Q1363706) (← links)
- Eternal \(m\)-security bondage numbers in graphs (Q1656913) (← links)
- Non-isolating 2-bondage in graphs (Q1946849) (← links)
- On bondage numbers of graphs: a survey with some comments (Q1953664) (← links)
- Some progress on total bondage in graphs (Q2014725) (← links)
- Characterization of trees with Roman bondage number 1 (Q2132180) (← links)
- The bondage number of generalized Petersen graphs \(P(n,2)\) (Q2188017) (← links)
- Domination in generalized unit and unitary Cayley graphs of finite rings (Q2195657) (← links)
- Domination in certain chemical graphs (Q2263696) (← links)
- Roman \(\{2\}\)-bondage number of a graph (Q2282478) (← links)
- The total bondage numbers and efficient total dominations of vertex-transitive graphs (Q2333221) (← links)
- On the complexity of multiple bondage in graphs (Q2333796) (← links)
- The \(k\)-rainbow bondage number of a digraph (Q2344014) (← links)
- Total restrained bondage in graphs (Q2376640) (← links)
- Bondage number of the strong product of two trees (Q2399299) (← links)
- Independent bondage number of a graph (Q2420662) (← links)
- Bondage number of grid graphs (Q2440103) (← links)
- The algorithmic complexity of bondage and reinforcement problems in bipartite graphs (Q2447764) (← links)
- The bondage numbers and efficient dominations of vertex-transitive graphs (Q2467738) (← links)
