Mutual-visibility in strong products of graphs via total mutual-visibility

DOI10.1016/J.DAM.2024.06.038zbMATH Open1547.05252MaRDI QIDQ6611058

Gabriele Di Stefano, Serafino Cicerone, Ismael G. Yero, Sandi Klavžar

Publication date: 26 September 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

strong product of graphsmutual-visibility numbermutual-visibility settotal mutual-visibility set

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Title not available (Why is that?)
• Mutual visibility by luminous robots without collisions
• Optimum algorithm for the mutual visibility problem
• On general position sets in Cartesian products
• On the mutual visibility in Cartesian products and triangle-free graphs
• The general position number of Cartesian products involving a factor with small diameter
• Mutual visibility in graphs
• A GENERAL POSITION PROBLEM IN GRAPH THEORY
• On the general position problem on Kneser graphs
• Fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreement

Related Items (3)

Total mutual-visibility in Hamming graphs ⋮ Variety of general position problems in graphs ⋮ The \(k\)-distance mutual-visibility problem in graphs

This page was built for publication: Mutual-visibility in strong products of graphs via total mutual-visibility

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