On the mutual visibility in Cartesian products and triangle-free graphs

DOI10.1016/j.amc.2022.127619OpenAlexW4304759551MaRDI QIDQ2096353

Sandi Klavžar, Gabriele Di Stefano, Serafino Cicerone

Publication date: 16 November 2022

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

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

zbMATH Keywords

triangle-free graphCartesian product of graphsindependent mutual-visibility setmutual-visibility numbermutual-visibility setZarenkiewicz's problem

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Related Items (4)

Variety of mutual-visibility problems in graphs ⋮ Total mutual-visibility in graphs with emphasis on lexicographic and Cartesian products ⋮ Geodesic packing in graphs ⋮ Mutual-visibility sets in Cartesian products of paths and cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing the metric dimension of a graph from primary subgraphs
• Mutual visibility by luminous robots without collisions
• Geodetic blocks of diameter three
• Optimum algorithm for the mutual visibility problem
• A new upper bound on the number of edges in a geodetic graph
• Supersaturation of \(C_4\): from Zarankiewicz towards Erdős-Simonovits-Sidorenko
• On general position sets in Cartesian products
• Equitable total coloring of corona of cubic graphs
• The general position problem on Kneser graphs and on some graph operations
• Neighbor sum distinguishing total colorings of corona of subcubic graphs
• The general position number of Cartesian products involving a factor with small diameter
• Characterization of general position sets and its applications to cographs and bipartite graphs
• On the corona of two graphs
• The general position number of integer lattices
• Mutual visibility in graphs
• Extremal Combinatorics
• The Graph Theory General Position Problem on Some Interconnection Networks
• A GENERAL POSITION PROBLEM IN GRAPH THEORY
• Characterization of classes of graphs with large general position number
• On the general position problem on Kneser graphs
• THE GENERAL POSITION NUMBER OF THE CARTESIAN PRODUCT OF TWO TREES
• On planar geodetic graphs
• On Graphs that do not Contain a Thomsen Graph
• On a problem of K. Zarankiewicz
• Fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreement
• Mutual visibility by asynchronous robots on infinite grid

This page was built for publication: On the mutual visibility in Cartesian products and triangle-free graphs