20.500.12556/RUL-186034 Resonance graphs that are daisy cubes: from hypercubes to independent sets via resonant sets Let $G$ be a plane elementary bipartite graph whose infinite face is forcing. We first provide a bijection between the set of maximal hypercubes of its resonance graph and the set of maximal resonant sets of $G$. In the special case where $G$ is a peripherally 2-colorable graph, it follows that there is a bijection between the set of maximal hypercubes of its resonance graph and the set of maximal independent sets of a tree that is the inner dual of $G$. We then show that the resonance graph of a plane bipartite graph $G$ is a daisy cube if and only if it is the simplex graph of the complement of a forest. Finally, we characterize trees with at most five maximal independent sets to determine daisy cubes that are simplex graphs of complements of trees and have at most five maximal vertices. daisy cube resonance graph simplex graph resonančni graf simpleksni graf true false true Angleški jezik Slovenski jezik Članek v reviji 2026-08-26 08:51:38 2026-08-26 08:51:39 2026-08-27 04:35:27 0000-00-00 00:00:00 2026 0 0 22 str. iss. 4, art. 152 Vol. 49 Aug. 2026 0000-00-00 Zaloznikova Objavljeno NiDoloceno 0000-00-00 0000-00-00 0000-00-00 519.17 0126-6705 10.1007/s40840-026-02122-5 287669507 s40840-026-02122-5.pdf s40840-026-02122-5.pdf 1 670EFAEDA284322C7C4C1959EA61E4F9 33e9cd741da5908b5ebb3e4604d4eda091e2080a6dc764281b92fccab33631ab e680af8e-a11a-11f1-9b0d-0050569b8976 https://repozitorij.uni-lj.si/Dokument.php?lang=slv&id=245084 https://link.springer.com/article/10.1007/s40840-026-02122-5 0 f87471d3-a11a-11f1-9b0d-0050569b8976 https://repozitorij.uni-lj.si/Dokument.php?lang=slv&id=245086 Fakulteta za strojništvo Fakulteta za matematiko in fiziko 0 0 0