Total mutual-visibility in graphs with emphasis on lexicographic and Cartesian products

DOI10.1007/s40840-023-01590-3zbMath1527.05149arXiv2306.15818OpenAlexW4387672311MaRDI QIDQ6090820

Dorota Kuziak, Juan Alberto Rodríguez-Velázquez

Publication date: 20 November 2023

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2306.15818

zbMATH Keywords

Cartesian productlexicographic productmutual-visibilitytotal mutual-visibility numbertotal mutual-visibility set

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Mutual visibility by luminous robots without collisions
• Optimum algorithm for the mutual visibility problem
• On the extremal combinatorics of the Hamming space
• On general position sets in Cartesian products
• The general position problem on Kneser graphs and on some graph operations
• On the mutual visibility in Cartesian products and triangle-free graphs
• The general position number of Cartesian products involving a factor with small diameter
• A Steiner general position problem in graph theory
• Mutual visibility in graphs
• A GENERAL POSITION PROBLEM IN GRAPH THEORY
• On the general position problem on Kneser graphs
• THE GENERAL POSITION NUMBER OF THE CARTESIAN PRODUCT OF TWO TREES
• Variety of mutual-visibility problems in graphs

This page was built for publication: Total mutual-visibility in graphs with emphasis on lexicographic and Cartesian products