Prev. Article Next Article Table of Contents

Research Article

Analysis of the Relationship among the Graphs Isomorphic to Multilayered Cyclic Fence Graphs (MLCFG)

Jingyan Xia^† and Haruo Hosoya*^‡

Department of Human Culture and Science, Graduate School of Ochanomizu University, and Department of Information Sciences, Ochanomizu University, Bunkyo-ku, Tokyo 112-8610, Japan

J. Chem. Inf. Comput. Sci., 2002, 42 (5), pp 1004–1010

DOI: 10.1021/ci0200063

Publication Date (Web): August 31, 2002

†

Graduate School of Ochanomizu University.

Corresponding author phone: +81-48-267-9432; fax: +81-48-267-9432; e-mail: hosoya@is.ocha.ac.jp.

‡

Ochanomizu University.

Abstract

Multilayered cyclic fence graphs (MLCFG, E_m,n, F_m,n, D_m,n, G_m,n_, X_m,n) are proposed to be defined, all of which are composed of m 2n-membered cycles with periodic bridging. They are also cubic and bipartite. Hamiltonian wheel graph, H (n,{j_k}), and parallelogram-shaped polyhex graph are also defined. All the members of MLCFGs are found to be isomorphic to the so-called “torus benzenoid graphs”, while some members of MLCFGs are found to be related to the Hamilton wheel graphs. Through the construction of Hamilton wheel graph and the matrix representation by Kirby, a number of isomorphic relations among MLCFGs, Hamilton wheel graphs, and polyhex graphs were obtained. These relations among the MLCFG members were found also by the help of the characteristic quantities of MLCFGs.