Resonance graphs of plane bipartite graphs as daisy cubes
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910815571935232 |
|---|---|
| author | Brezovnik, Simon Che, Zhongyuan Tratnik, Niko Pleteršek, Petra Žigert |
| author_facet | Brezovnik, Simon Che, Zhongyuan Tratnik, Niko Pleteršek, Petra Žigert |
| contents | We characterize plane bipartite graphs whose resonance graphs are daisy cubes, and therefore generalize related results on resonance graphs of benzenoid graphs, catacondensed even ring systems, as well as 2-connected outerplane bipartite graphs. Firstly, we prove that if $G$ is a plane elementary bipartite graph other than $K_2$, then the resonance graph of $G$ is a daisy cube if and only if the Fries number of $G$ equals the number of finite faces of $G$. Next, we extend the above characterization from plane elementary bipartite graphs to plane bipartite graphs and show that the resonance graph of a plane bipartite graph $G$ is a daisy cube if and only if $G$ is weakly elementary bipartite such that each of its elementary component $G_i$ other than $K_2$ holds the property that the Fries number of $G_i$ equals the number of finite faces of $G_i$. Along the way, we provide a structural characterization for a plane elementary bipartite graph whose resonance graph is a daisy cube, and show that a Cartesian product graph is a daisy cube if and only if all of its nontrivial factors are daisy cubes. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2311_06508 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Resonance graphs of plane bipartite graphs as daisy cubes Brezovnik, Simon Che, Zhongyuan Tratnik, Niko Pleteršek, Petra Žigert Combinatorics 05C10 05C70 05C75 05C92 05C76 We characterize plane bipartite graphs whose resonance graphs are daisy cubes, and therefore generalize related results on resonance graphs of benzenoid graphs, catacondensed even ring systems, as well as 2-connected outerplane bipartite graphs. Firstly, we prove that if $G$ is a plane elementary bipartite graph other than $K_2$, then the resonance graph of $G$ is a daisy cube if and only if the Fries number of $G$ equals the number of finite faces of $G$. Next, we extend the above characterization from plane elementary bipartite graphs to plane bipartite graphs and show that the resonance graph of a plane bipartite graph $G$ is a daisy cube if and only if $G$ is weakly elementary bipartite such that each of its elementary component $G_i$ other than $K_2$ holds the property that the Fries number of $G_i$ equals the number of finite faces of $G_i$. Along the way, we provide a structural characterization for a plane elementary bipartite graph whose resonance graph is a daisy cube, and show that a Cartesian product graph is a daisy cube if and only if all of its nontrivial factors are daisy cubes. |
| title | Resonance graphs of plane bipartite graphs as daisy cubes |
| topic | Combinatorics 05C10 05C70 05C75 05C92 05C76 |
| url | https://arxiv.org/abs/2311.06508 |