2020/05/27 by Tanja Gologranc, Gologranc, Tanja, Andrej Taranenko +1
Computer Science · Mathematics · #05C75 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Graph theory and applications
paper · pdf · doi:10.48550/arxiv.2005.13320
openalex publication_date 2020/05/27 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Daisy graphs of a rooted graph G with the root r were recently introduced as a generalization of daisy cubes, a class of isometric subgraphs of hypercubes. In this paper we first solve the problem posed in \citeTaranenko2020 and characterize rooted graphs G with the root r for which all daisy graphs of G with respect to r are isometric in G. We continue the investigation of daisy graphs G (generated by X) of a Hamming graph H and characterize those daisy graphs generated by X of cardinality 2 that are isometric in H. Finally, we give a characterization of isometric daisy graphs of a Hamming graph Kk1\Box … \Box Kkn with respect to 0n in terms of an expansion procedure.