Abstract
The following conjecture is introduced: a connected composite graph G × H with G and H on more than two points is uniquely determined by each of its two-point deleted subgraphs. A theorem is proved that supports the conjecture.
This is a preview of subscription content, log in via an institution to check access.
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
J.A. Bondy and R.L. Hemminger, Graph reconstruction — a survey, J. Graph Theory 1 (1977), 227–268.
W. Dörfler, Some results on the reconstruction of graphs, Infinite and Finite Sets, Vol. 1. ed. A. Hajnal et al. (North-Holland, Amsterdam, 1975), 361–383.
D.A. Holton and J.A. Sims, Graphs with stability index one, J. Austral. Math. Soc. Ser. A 22 (1976), 212–220.
G. Sabidussi, Graph multiplication, Math. Zeit. 72 (1960), 446–457.
Julie Sims, Stability of the cartesian product of graphs. (M.Sc. thesis, University of Melbourne, 1976).
Julie Sims and D.A. Holton, Stability of cartesian products, J. Combin. Theory Ser. B 25 (1978), 258–282.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1980 Springer-Verlag
About this paper
Cite this paper
McAvaney, K.L. (1980). A conjecture on two-point deleted subgraphs of cartesian products. In: Robinson, R.W., Southern, G.W., Wallis, W.D. (eds) Combinatorial Mathematics VII. Lecture Notes in Mathematics, vol 829. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0088911
Download citation
DOI: https://doi.org/10.1007/BFb0088911
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10254-0
Online ISBN: 978-3-540-38376-5
eBook Packages: Springer Book Archive