Equidistant dimension of Cartesian product graphs
Abstract
Given a connected graph G, the equidistant dimension of G represents the cardinality of the smallest set of vertices S of G such that for any two vertices x,y S there is at least one vertex in S equidistant to both x,y in terms of distances. In this article, we compute the equidistant dimension of some Cartesian product graphs including two-dimensional Hamming graphs, some hypercubes, prisms of cycle, and squared grid graphs.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.