20.500.12556/DKUM-88118 Daisy Hamming graphs 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 address a problem posed in [A. Taranenko, Daisy cubes: A characterization and a generalization, European J. Combin. 85 (2020) #103058] and characterize rooted graphs G with the root r for which all daisy graphs of G with respect to r are isometric in G, assuming the graph G satisfies the rooted triangle condition. 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 thatare isometric in H. Finally, we give a characterization of isometric daisy graphs of a Hamming graph Kk1 · · · Kkn with respect to 0n in terms of an expansion procedure. daisy graphs expansion isometric subgraphs marjetični grafi ekspanzije izometrični podgrafi true true true Technical University Press Angleški jezik Slovenski jezik Članek v reviji 2024-04-10 03:45:47 2024-07-09 10:47:12 2024-07-10 04:36:41 0000-00-00 00:00:00 2023 0 0 str. 421-436 no. 2 Vol. 43 2023 0000-00-00 Zaloznikova Objavljeno NiDoloceno 2020-05-27 2020-10-20 2020-10-20 519.17 137313795 10.7151/dmgt.2373 1234-3099 RAZ_Dravec_Tanja_2023.pdf RAZ_Dravec_Tanja_2023.pdf 1 82D3EC18151A047F2F6F75455980B50A 26a2511345152076e8b2cc1d1d340f9c1560783f0df349cb88be2b5e3f3f6233 b1ebe84b-3dcd-11ef-9361-00155d000105 https://dk.um.si/Dokument.php?lang=slv&id=181276 https://doi.org/10.7151/dmgt.2373 0 f1d1e665-3dcd-11ef-9361-00155d000105 https://dk.um.si/Dokument.php?lang=slv&id=181277 Fakulteta za naravoslovje in matematiko 0 0 0