3 papers
math.CO2026
Resonance graphs that are daisy cubes: from hypercubes to independent sets via resonant sets
Simon Brezovnik, Zhongyuan Che, Niko Tratnik +1
Let be a plane elementary bipartite graph whose infinite face is forcing. We provide a bijection between the set of maximal hypercubes of its resonance graph and the set of max…
math.CO2024
Resonance graphs of plane bipartite graphs as daisy cubes
Simon Brezovnik, Zhongyuan Che, Niko Tratnik +1
We characterize plane bipartite graphs whose resonance graphs are daisy cubes, and therefore generalize related results on resonance graphs of benzenoid graphs, catacondensed even…
math.CO2024
On the Wiener-like root-indices of graphs
Simon Brezovnik, Matthias Dehmer, Niko Tratnik +1
In this paper, we examine roots of graph polynomials where those roots can be considered as structural graph measures. More precisely, we prove analytical results for the roots of…