5 papers
Isomorphic daisy cubes based on their -graphs
Zhongyuan Che, Niko Tratnik, Petra Žigert Pleteršek
We prove that if and are daisy cubes whose -graphs are forests, then and are isomorphic if and only if their -graphs are isomorphic. The result is applied t…
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…
Efficient graph similarity assessment method based on vectors of topological indices
Matthias Dehmer, Izudin RedžepoviÄ, Niko Tratnik +1
Measuring similarity between complex objects is a fundamental task in many scientific fields. When objects are represented as graphs, graph similarity/distance measures offer a pow…
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…
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…