A Remark on Dot-Compositions of Graphs
If G and H are graphs with the property that the identification of any vertex of G with an arbitrary vertex of H results in a unique graph (up to isomorphism), then we write G.H for the thus obtained graph. This definition is in , p. 23. The graph G.H is called the dot-composition of G and H, the graphs G and H are called dot-components of this graph.
B. DEVADAS ACHARYA: A research problem. Graph Theory Newsletter 2(1973), . No. 3, p. 6.
F. HARARY: Graph Theory. Addison-Wesey Publishing Company, 1969.
O. ORF: Theory of Graphs. Providence 1962.
- There are currently no refbacks.