JSTOR Daily

Computing the (𝑘-)monopoly Number of Direct Product of Graphs

Abstract.Let 𝐺 = (𝑉, 𝐸) be a simple graph without isolated vertices and minimum degree 𝛿(𝐺), and let 𝑘 ∈ {1-[𝛿(𝐺)/2,...,[𝛿(𝐺)/2} be an ...