![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextgreen.png)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextred.png)
![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextgreen.png)
![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltext_open_medium.gif)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextred.png)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltext_restricted_medium.gif)
The Dot Composition of Infinite Graphs
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
Font Size
Information
![](https://i-scholar.in/public/site/images/abstractview.png)
Abstract Views: 193
![](https://i-scholar.in/public/site/images/pdfview.png)
PDF Views: 0