Pages that link to "Item:Q4641566"
From MaRDI portal
The following pages link to Upper bounds on the bondage number of the strong product of a graph and a tree (Q4641566):
Displaying 6 items.
- Bounding the open \(k\)-monopoly number of strong product graphs (Q1692650) (← links)
- Matching preclusion for direct product of regular graphs (Q2306600) (← links)
- Bondage number of the strong product of two trees (Q2399299) (← links)
- Construction for trees without domination critical vertices (Q2671102) (← links)
- The bondage number of the strong product of a complete graph with a path and a special starlike tree (Q2798318) (← links)
- On construction for trees making the equality hold in Vizing's conjecture (Q6057635) (← links)