Pages that link to "Item:Q1322182"
From MaRDI portal
The following pages link to Bounds on the bondage number of a graph (Q1322182):
Displaying 42 items.
- The bondage number of random graphs (Q281604) (← 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)
- An improved upper bound for the bondage number of graphs on surfaces (Q449115) (← 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)
- On the bondage, strong and weak bondage numbers in complementary prism graphs (Q821325) (← links)
- The bondage numbers of graphs with small crossing numbers (Q882111) (← links)
- Restrained bondage in graphs (Q998423) (← links)
- On the bondage number of a graph (Q1126221) (← links)
- A bound on the size of a graph with given order and bondage number (Q1292849) (← 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)
- Changing and unchanging of the domination number of a graph: path addition numbers (Q2227098) (← links)
- Domination in certain chemical graphs (Q2263696) (← links)
- On the complexity of multiple bondage in graphs (Q2333796) (← 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 bondage numbers and efficient dominations of vertex-transitive graphs (Q2467738) (← links)
- The bondage numbers of extended de Bruijn and Kautz digraphs (Q2475906) (← links)
- On the bondage number of planar and directed graphs (Q2495520) (← links)
- Independent bondage number of planar graphs with minimum degree at least 3 (Q2675833) (← links)
- 2-bondage in graphs (Q2855759) (← links)
- On the average lower bondage number of a graph (Q2954366) (← links)
- A BOUND ON THE BONDAGE NUMBER OF TOROIDAL GRAPHS (Q3166755) (← links)
- Upper bounds on the bondage number of the strong product of a graph and a tree (Q4641566) (← links)
- Upper bounds on the bondage number of a graph (Q5009964) (← links)
- On the double bondage number of graphs products (Q5135723) (← links)
- The k-power bondage number of a graph (Q5298349) (← links)
- On the average lower bondage number of graphs under join and corona operations (Q6064682) (← links)
- On the double Roman bondage numbers of graphs (Q6115753) (← links)