On the monopolies of lexicographic product graphs: bounds and closed formulas

MaRDI QIDQ4591109zbMATH OpenFDO

Authors Dorota Kuziak, Iztok Peterin, Ismael G. Yero

Publication date 10 November 2017

zbMATH Keywords

lexicographic 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)

Recommendations

• Computing the (\(k\)-)monopoly number of direct product of graphs
• Bounding the open \(k\)-monopoly number of strong product graphs
• On the monopoly of graphs
• A study of monopolies in graphs
• The complexity of open \(k\)-monopolies in graphs for negative \(k\)

Cited in

(3)

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

This page was built for publication: On the monopolies of lexicographic product graphs: bounds and closed formulas

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4591109)