Variety of mutual-visibility problems in hypercubes

DOI10.1016/J.AMC.2024.129218MaRDI QIDQ6994108zbMATH OpenFDO

Authors Danilo Korže, Aleksander Vesel

Publication date 24 April 2025

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

Full work available at URL https://doi.org/10.1016/J.AMC.2024.129218

zbMATH Keywords

binary codehypercubemutual visibility

Mathematics Subject Classification ID

Hypergraphs (05C65) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites work

• A table of upper bounds for binary codes
• Fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreement
• Graphs with total mutual-visibility number zero and total mutual-visibility in Cartesian products
• Handbook of product graphs
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• Lower (total) mutual-visibility number in graphs
• Mutual and total mutual visibility in hypercube-like graphs
• Mutual visibility by asynchronous robots on infinite grid
• Mutual visibility by luminous robots without collisions
• Mutual visibility in graphs
• Mutual-visibility problems on graphs of diameter two
• New results on radio \(k\)-labelings of distance graphs
• Optimum algorithm for the mutual visibility problem
• Recognizing halved cubes in a constant time per edge
• Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
• Variety of mutual-visibility problems in graphs

Cited in

(4)

• Coloring the vertices of a graph with mutual-visibility property
• Visibility polynomials, dual visibility spectrum, and characterization of total mutual-visibility sets
• Mutual-visibility and general position sets in Sierpiński triangle graphs
• Visibility in hypercubes

This page was built for publication: Variety of mutual-visibility problems in hypercubes

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