The Dot Composition of Infinite Graphs

Jump To References Section

Authors

  • S. B. Rao
     Department of Mathematics, University of Bombay, Vidyanagari Marg, Kalina, Bombay 400 029 ,IN

Abstract

Let G and H be two undirected graphs (finite or infinite) on disjoint sets of vertices. Let u and v be arbitrary vertices of G and H respectively. Define Du,v(G, H) to be the graph obtained from G and H by identifying the vertices u and v.

Downloads

Download data is not yet available.

Metrics

Metrics Loading ...

Downloads

Published

1975-12-01

How to Cite

Rao, S. B. (1975). The Dot Composition of Infinite Graphs. The Journal of the Indian Mathematical Society, 39(1-4), 181–187. Retrieved from https://informaticsjournals.co.in/index.php/jims/article/view/16646

Issue

Volume 39, Issue 1-4, March-December 1975

Section

Articles

License

Copyright (c) 1975 S. B. Rao

Creative Commons License

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

 

References

B. DEVADAS ACHARYA, A Research Problem Abstract 2. Graph Theory Newsletter Vol. 3 (No. 2) Jan. 1973.

F. HARARY, Graph Theory, Addison-Wesley, Reading, 1969.

C.G. PINTER, Set Theory Addison-Wesley, Reading 1971.

S.B. Rao, Enumeration problems-infinite case, (underpreparation).

B. ZELINKA, A remark on dot compositions of graphs /. Indian Math. Soc. (To appear).