Abstract
If G and H are two connected non-trivial graphs, not necessarily of finite order, then we show that the cartesian product G × H, is stable in the sense of Sheehan [4]. Moreover except when G=P2 and H is a certain restricted class of prime graphs, any edge of G × H may be removed to give the stability, i.e. G × H is completely stable.
Consideration is given to the case where G × H is not connected. In the case of finite graphs G × H is stable unless one of G or H is totally disconnected and the other is not stable. For non-finite graphs the situation is not as clear. We give examples of cartesian products of non-finite graphs which are not stable.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
M. Behzad and G. Chartrand, Introduction To The Theory of Graphs, Allyn and Bacon, Boston, (1971).
W. Dörfler, Some results on the reconstruction of graphs, Coll. Math. Soc. János Bolyai, 10, North Holland, Amsterdam, (1975), 361–383.
G. Sabidussi, Graph Multiplication, Math. Zeit., 72, (1960), 446–457.
J. Sheehan, Fixing subgraphs, J. Comb. Th. 12(B), (1972), 226–244.
J. Sims and D. A. Holton, Stability of cartesian products, to appear.
J. Sims. Stability of the cartesian product of graphs, M.Sc. Thesis, University of Melbourne, 1976.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1978 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Holton, D.A., Sims, J. (1978). The cartesian product of two graphs is stable. In: Alavi, Y., Lick, D.R. (eds) Theory and Applications of Graphs. Lecture Notes in Mathematics, vol 642. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0070385
Download citation
DOI: https://doi.org/10.1007/BFb0070385
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08666-6
Online ISBN: 978-3-540-35912-8
eBook Packages: Springer Book Archive