Pages that link to "Item:Q1953664"

The following pages link to On bondage numbers of graphs: a survey with some comments (Q1953664):

Displaying 39 items.

• The bondage number of random graphs (Q281604) (← links)
• Minimum edge blocker dominating set problem (Q319914) (← links)
• Upper bounds for domination related parameters in graphs on surfaces (Q334124) (← links)
• NP-hardness of multiple bondage in graphs (Q491093) (← links)
• Bondage numbers of Mycielski graphs (Q726515) (← links)
• A survey of bond graphs: Theory, applications and programs (Q810538) (← links)
• On the bondage, strong and weak bondage numbers in complementary prism graphs (Q821325) (← links)
• The bondage number in complete \(t\)-partite digraphs (Q989552) (← links)
• The bondage and reinforcement numbers of \(\gamma_ f\) for some graphs (Q1356465) (← links)
• Eternal \(m\)-security bondage numbers in graphs (Q1656913) (← links)
• Remarks on the bondage number of planar graphs (Q1861243) (← links)
• The bondage number of graphs on topological surfaces and Teschner's conjecture (Q1942673) (← links)
• On the \(\rho \)-edge stability number of graphs (Q2062684) (← links)
• Characterization of trees with Roman bondage number 1 (Q2132180) (← links)
• The bondage number of generalized Petersen graphs \(P(n,2)\) (Q2188017) (← links)
• On the minimum number of bond-edge types and tile types: an approach by edge-colorings of graphs (Q2306579) (← 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)
• Bondage number of the strong product of two trees (Q2399299) (← links)
• Bondage number of grid graphs (Q2440103) (← links)
• The algorithmic complexity of bondage and reinforcement problems in bipartite graphs (Q2447764) (← 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)
• The bondage number of the strong product of a complete graph with a path and a special starlike tree (Q2798318) (← links)
• A BOUND ON THE BONDAGE NUMBER OF TOROIDAL GRAPHS (Q3166755) (← links)
• Roman Domination in Graphs (Q3384614) (← links)
• The Disjunctive Bondage Number and the Disjunctive Total Bondage Number of Graphs (Q3467878) (← links)
• The bondage number of graphs:good and bad vertices (Q3633838) (← links)
• (Q4595227) (← 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)
• (Q5038382) (← links)
• Open packing bondage number of a graph (Q5242822) (← links)
• The k-power bondage number of a graph (Q5298349) (← links)
• On the complexity of the outer-connected bondage and the outer-connected reinforcement problems (Q5377042) (← links)
• A Gallai’s Theorem type result for the edge stability of graphs (Q6063845) (← links)
• Some results of weakly nilpotent graphs of rings (Q6097370) (← links)
• A survey on the Intersection graphs of ideals of rings (Q6101486) (← links)
• On the double Roman bondage numbers of graphs (Q6115753) (← links)