Resonance graphs that are daisy cubes: from hypercubes to independent sets via resonant setsBrezovnik, Simon (Avtor) Che, Zhongyuan (Avtor) Tratnik, Niko (Avtor) Žigert Pleteršek, Petra (Avtor) daisy cuberesonance graphsimplex graphLet $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.20262026-08-26 08:51:38Članek v reviji186034UDK: 519.17ISSN pri članku: 0126-6705DOI: 10.1007/s40840-026-02122-5COBISS_ID: 287669507sl