This web page contains the abstract of my paper:

"Reconstruction of a Pair of Graphs from their Concatenations" with S. Kundu, E. Sampathkumar and D. Sturtevant, SIAM J. Alg. and Disc. Meth., 1(1980), p. 228-231.

Abstract: A concatenation of two vertex disjoint graphs is defined to be the graph obtained by identifying a vertex of one graph with a vertex of the other graph. We show that an arbitrary pair of connected graphs can be uniquely reconstructed from the set of all their distinct concatenations, with only trivial exceptions.

[ IBM Research home page | James B. Shearer's home page | Up ]
[ IBM home page | Order | Search | Contact IBM | Help | (C) | (TM) ]