Abstract
Let G be a 2-connected outerplane bipartite graph and R(G) be its resonance graph. It is known that R(G) is a median graph. Assume that s is a reducible face of G and H is the subgraph of G obtained by removing all internal vertices (if exist) and edges on the common periphery of s and G. We show that R(G) can be obtained from R(H) by a peripheral convex expansion. As an application, we prove that Θ(R(G)) is a tree and isomorphic to the inner dual of G, where Θ(R(G)) is the induced graph on the Djoković–Winkler relation Θ-classes of R(G).
| Original language | English (US) |
|---|---|
| Pages (from-to) | 264-268 |
| Number of pages | 5 |
| Journal | Discrete Applied Mathematics |
| Volume | 258 |
| DOIs | |
| State | Published - Apr 15 2019 |
All Science Journal Classification (ASJC) codes
- Discrete Mathematics and Combinatorics
- Applied Mathematics
Fingerprint
Dive into the research topics of 'A characterization of the resonance graph of an outerplane bipartite graph'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver