The Journal of the Indian Mathematical Society

Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

The Dot Composition of Infinite Graphs


Affiliations
1 Department of Mathematics, University of Bombay, Vidyanagari Marg, Kalina, Bombay 400 029, India
     

   Subscribe/Renew Journal


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.
Subscription Login to verify subscription
User
Notifications
Font Size


Abstract Views: 241

PDF Views: 0




  • The Dot Composition of Infinite Graphs

Abstract Views: 241  |  PDF Views: 0

Authors

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

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.