Open Access
Subscription Access
Open Access
Subscription Access
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
Abstract Views: 231
PDF Views: 0