Total mutual-visibility in Hamming graphs

DOI10.7494/OPMATH.2025.45.1.63MaRDI QIDQ6667291

Sandi Klavžar, Csilla Bujtás, Jing Tian

Publication date: 20 January 2025

Published in: Opuscula Mathematica (Search for Journal in Brave)

zbMATH Keywords

Hamming graphTurán-type problemmutual-visibility settotal mutual-visibility set

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Paths and cycles (05C38) Distance in graphs (05C12) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Mutual visibility by luminous robots without collisions
• On the mutual visibility in Cartesian products and triangle-free graphs
• Mutual visibility in graphs
• Mutual visibility on grid by asynchronous luminous robots
• Extremal Finite Set Theory
• Fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreement
• Total mutual-visibility in graphs with emphasis on lexicographic and Cartesian products
• Mutual-visibility in strong products of graphs via total mutual-visibility

This page was built for publication: Total mutual-visibility in Hamming graphs

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