Computing the (k-)monopoly number of direct product of graphs

DOI10.2298/FIL1505163KzbMath1464.05294OpenAlexW1942288587MaRDI QIDQ5278637

Iztok Peterin, Ismael González Yero, Dorota Kuziak

Publication date: 19 July 2017

Published in: Filomat (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2298/fil1505163k

zbMATH Keywords

direct product graphsmonopolies

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Related Items (2)

The complexity of open k-monopolies in graphs for negative k ⋮ Bounding the open \(k\)-monopoly number of strong product graphs

This page was built for publication: Computing the (k-)monopoly number of direct product of graphs