Abstract
Supplementing the construction of a Möbius ladder graph derived from a ladder graph, the linear fence graph and cyclic fence graph are introduced. These have neater mathematical expressions for the perfect matching numbers and the matching and characteristic polynomials than the graphs in the previous families.
Similar content being viewed by others
References
F. Harary, Graph Theory (Addison-Wesley, Reading, 1969).
R.K. Guy and F. Harary, Can. Math. Bull. 10 (1967)493.
D.M. Walba, R.M. Richards and R.C. Haltiwanger, J. Am. Chem. Soc. 104 (1982)3219.
D.M. Walba, J. Simon and F. Harary, Tetrahedron Lett. 29 (1988)731.
H. Hosoya, J. Math. Chem. 7 (1991)289.
H. Hosoya, Bull. Chem. Soc. Japan 44 (1971)2332.
H. Hosoya, Fibonacci Quart. 11 (1973)255.
H. Hosoya and N. Ohkami, J. Comput. Chem. 4 (1983)585.
H. Hosoya and A. Motoyama, J. Math. Phys. 26 (1985)157.
H. Hosoya, Comput. Math. Appl. 12B (1986)271.
H. Hosoya, Discr. Appl. Math. 19 (1988)239.
S.J. Cyvin and I. Gutman,Kekulé Structures in Benzenoid Hydrocarbons, Lecture Notes in Chemistry, No. 46 (Springer, Berlin, 1988).
E. Heilbronner, Helv. Chim. Acta 36 (1953)170.
H. Hosoya, M. Aida, R. Kumagai and K. Watanabe, J. Comput. Chem. 8 (1987)358.
H. Hosoya, H. Kumagai, K. Chida, M. Ohuchi and Y.-D. Gao, Pure Appl. Chem. 62 (1990)445.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hosoya, H., Harary, F. On the matching properties of three fence graphs. J Math Chem 12, 211–218 (1993). https://doi.org/10.1007/BF01164636
Issue Date:
DOI: https://doi.org/10.1007/BF01164636