A Remark on Dot-Compositions of Graphs

Jump To References Section

Authors

  • Bohdan Zelinka
     Department of Mathematics, Liberec, Czechoslovakia ,CZ

Abstract

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 [2], 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.

Downloads

Download data is not yet available.

Downloads

Published

1974-12-01

How to Cite

Zelinka, B. (1974). A Remark on Dot-Compositions of Graphs. The Journal of the Indian Mathematical Society, 38(1-4), 221–225. Retrieved from http://informaticsjournals.com/index.php/jims/article/view/16695

Issue

Volume 38, Issue 1-4, March-December 1974

Section

Articles

License

Copyright (c) 1974 Bohdan Zelinka

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

 

References

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.