The Z-transformation graph of G with respect to F, denoted by ZF(G), is defined as a graph in which the vertices are the perfect matchings of G and two vertices ...

Let G be a plane bipartite graph with at least two perfect matchings. The Z-transformation graph, ZF (G), of G with respect to a specific set F of faces is ...

Given a plane bipartite graph G with a perfect matching M. If the boundary of an inner face is an M-alternating cycle C, a Z-transformation (twist, or flip) is ...

Let G be a plane bipartite graph. The Z-transformation graph Z(G) and its orientation Z → (G) on the maximum matchings of G are defined. If G has a perfect ...

Block Graphs of Z-transformation Graphs of Perfect Matchings of Plane Elementary Bipartite Graphs · Heping Zhang, Fuji Zhang · Published in Ars Comb. 1 October ...

From a mathematical point of view, in 1988 F. Zhang, X. Guo and R. Chen introduced "Z-transformation graph" (Randić named after "resonance graph" in ...

Semantic Scholar extracted view of "Total Z-transformation graphs of perfect matching of plane bipartite graphs" by Heping Zhang et al.

Let G be a plane bipartite graph. The Z-transformation graph Z(G) and its orientation Z(G) on the maximum matchings of G are defined. If G has a perfect ...

The Z -transformation graph, Z F ( G ), of G with respect to a specific set F of faces is defined as a graph on the perfect matchings of G such that two perfect ...

TL;DR: In this paper, a plane bipartite graph G with a Kekule pattern is considered, and an edge of G is called non-fixed if it belongs to some, but not all, ...