Abstract
In this paper, some general properties of the binding number of product graphs are obtained. Also given are some formulas and limit properties of the binding number of the product of some special graphs.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
F. Harary, Graph Theory, Addison Wesley, Mass., 1969.
V. G. Kane, S. P. Mohanty and R. S. Hales, Product Graphs and Binding Number, Ars Combinatoria Vol. 11 (1981) 201–224.
Liu Jiuqiang, Tian Songlin, The Binding Number of the Cartesian product of n circuits (to appear).
Luo Youxue, The Binding Number of Product Graphs — proof of a conjecture of V. G. Kane, et al. (to appear).
D. R. Woodall, The Binding Number of a Graph and Its Anderson Number, J. Comb. Theory, Ser. B. 15 (1973), 225–255.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag
About this paper
Cite this paper
Jianfang, W., Songlin, T., Jiuqiang, L. (1984). The binding number of product graphs. In: Koh, K.M., Yap, H.P. (eds) Graph Theory Singapore 1983. Lecture Notes in Mathematics, vol 1073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0073110
Download citation
DOI: https://doi.org/10.1007/BFb0073110
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13368-1
Online ISBN: 978-3-540-38924-8
eBook Packages: Springer Book Archive