The H-join of arbitrary families of graphs
The H-join of a family of graphs G = {G1, . . . , Gp}, also called the generalized composition, H[G1, . . . , Gp], where all graphs are undirected, simple and finite, is the graph obtained from the graph H replacing each vertex i of H by Gi and adding to the edges of all graphs in G the edges of the...
| Autor principal: | |
|---|---|
| Outros Autores: | , |
| Formato: | preprint |
| Idioma: | eng |
| Publicado em: |
2021
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10773/30376 |
| País: | Portugal |
| Oai: | oai:ria.ua.pt:10773/30376 |