Abstract
A perfect matching of a graph is a set of independent edges that covers all vertices of the graph. A bipartite graph is elementary if and only if it is connected and each edge is contained in a perfect matching. The resonance graph of a plane bipartite graph G is a graph whose vertices are perfect matchings of G, and two perfect matchings are adjacent if edges contained in their union but not intersection form a cycle surrounding a finite face of G. It is well known that the resonance graph of a plane elementary bipartite graph is a median graph. Median graphs form an important subclass of partial cubes and have a wide range of applications. The most important structural characterization of a median graph is the Mulder’s convex expansion theorem. Fibonacci cubes used in network designs are median graphs and can be obtained from an edge by a sequence of peripheral convex expansions. Plane bipartite graphs whose resonance graphs are Fibonacci cubes were studied by Klavžar et al. first for their applications in chemistry and completely characterized by Zhang et al. later. Motivated from their work, we characterize all plane bipartite graphs whose resonance graphs can be constructed from an edge by a sequence of peripheral convex expansions.
We’re sorry, something doesn't seem to be working properly.
Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.
Data Availability
Data statement supplied by Springer: Data sharing not applicable to this article as no datasets were generated or analyzed during the current study.
References
Birkhoff, G.: Lattice Theory. American Mathematical Society Colloquium Publications Vol. XXV, 3rd Edn.. American Mathematical Society, Providence (1967)
Bandelt, H.-J., Chepoi, V.: Metric graph theory and geometry: a survey. Contemp. Math. 453, 49–86 (2008)
Che, Z.: Structural properties of resonance graphs of plane elementary bipartite graphs. Discret. Appl. Math. 247, 102–110 (2018)
Che, Z.: Characterizations of the resonance graph of an outerplane bipartite graph. Discret. Appl. Math. 258, 264–268 (2019)
Che, Z.: Cube-free resonance graphs. Discret. Appl. Math. 284, 262–268 (2020)
Che, Z., Chen, Z.: Forcing faces in plane bipartite graphs. Discrete Math. 308, 2427–2439 (2008)
Che, Z., Chen, Z.: Forcing faces in plane bipartite graphs (II). Discret. Appl. Math. 161, 71–80 (2013)
Chung, F.R.K., Graham, R.L., Saks, M.E.: Dynamic search in graphs, Discrete Algorithms and Complexity, pp. 351–387. Kyoto (1986)
Cohen, M., Teicher, M.: Kauffman’s clock lattice as a graph of perfect matchings: a formula for its height. Electron. J. Combin. 21, Paper 4.31, 39 (2014)
Fournier, J.C.: Combinatorics of perfect matchings in plane bipartite graphs and application to tilings, Theoret. Comput. Sci. 303, 333–351 (2003)
Hsu, W.-J.: Fibonacci cubes - a new interconnection topology. IEEE Trans. Parallel Distrib. Syst. 4, 3–12 (1993)
Hammack, R., Imrich, W., Klavžar, S.: Handbook of Product Graphs, 2nd. Discrete Mathematics and its Applications (Boca Raton). CRC Press, Boca Raton (2011)
Klavžar, S.: On median nature and enumerative properties of Fibonacci-like cubes. Discrete Math. 299, 145–153 (2005)
Knuth, D.E.: Median algebras and median graphs, The Art of Computer Programming, IV, Fascicle 0: Introduction to Combinatorial Algorithms and Boolean Functions, pp. 64–74. Addison-Wesley (2008)
Klavžar, S., Žigert, P.: Fibonacci cubes are the resonance graphs of fibonaccenes. Fibonacci Quart. 43, 269–27 (2005)
Klavžar, S., Mulder, H.M.: Median graphs: characterizations, location theory and related structures. J. Combin. Math. Combin. Comput. 30, 103–127 (1999)
Lovász, L., Plummer, M.D.: Matching Theory. North-Holland Publishing Co., Amsterdam (1986)
Lam, P.C.B., Zhang, H.: A distributive lattice on the set of perfect matchings of a plane bipartite graph. Order 20, 13–29 (2003)
Taranenko, A., Vesel, A.: 1-Factors and characterization of reducible faces of plane elementary bipartite graphs. Discuss. Math. Graph Theory 32, 289–297 (2012)
Vesel, A.: Characterization of resonance graphs of catacondensed hexagonal graphs. MATCH Commun. Math. Comput. Chem. 53, 195–208 (2005)
Zhang, H.: Z-transformation graphs of perfect matchings of plane bipartite graphs: a survey. MATCH Commun. Math. Comput. Chem. 56, 457–476 (2006)
Zhang, H., Lam, P.C.B., Shiu, W.C.: Resonance graphs and a binary coding for the 1-factors of benzenoid systems. SIAM J. Discret. Math. 22, 971–984 (2008)
Zhang, H., Ou, L., Yao, H.: Fibonacci-like cubes as Z-transformation graphs. Discret. Math. 309, 1284–1293 (2009)
Zhang, H., Zhang, F.: The rotation graphs of perfect matchings of plane bipartite graphs. Discret. Appl. Math. 73, 5–12 (1997)
Zhang, H., Zhang, F.: Plane elementary bipartite graphs. Discret. Appl. Math. 105, 291–311 (2000)
Zhang, H., Zhang, F., Yao, H.: Z-transformation graphs of perfect matchings of plane bipartite graphs. Discrete Math. 276, 393–404 (2004)
Acknowledgments
The research work is supported by the Research Development Grant (RDG) from Penn State University, Beaver Campus. The author would like to thank the referees for their helpful comments.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Che, Z. Peripheral Convex Expansions of Resonance Graphs. Order 38, 365–376 (2021). https://doi.org/10.1007/s11083-020-09545-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11083-020-09545-0