Optimal graph embeddings represent graphs in a lower dimensional space in a way that preserves the structure and properties of the original graph. These techniques have wide applications in fields such as machine learning, data mining, and network analysis. Do we have small (if possible minimal) k -connected graphs with the property that for any j vertices there is a longest path avoiding all of them? This question of Zamfirescu (1972) was the first variant of Gallai’s question (1966): Do all longest paths in a connected graph share a common vertex? Several good examples answering Zamfirescu’s question are known. In 2001, he asked to investigate the family of geometrical lattices with respect to this property. In 2017, Chang and Yuan proved the existence of such graphs in Archimedean tiling. Here, we prove that the graphs presented by Chang and Yuan are not optimal by constructing such graphs of sufficiently smaller orders. The problem of finding nonconcurrent longest paths in Archimedean tessellations refers to finding paths in a lattice such that the paths do not overlap or intersect with each other and are as long as possible. The complexity of embedding graph is still unknown. This problem can be challenging because it requires finding paths that are both long and do not intersect, which can be difficult due to the constraints of the lattice structure.
ASJC Scopus subject areas
- Computer Science(all)