Graph amalgamation
≈ 2 min read
Names in other languages
- EnglishGraph amalgamation
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In graph theory, a graph amalgamation is a relationship between two graphs (one graph is an amalgamation of another). Similar relationships include subgraphs and minors. Amalgamations can provide a way to reduce a graph to a simpler graph while keeping certain structure intact. The amalgamation can then be used to study properties of the original graph in an easier to understand context. Applications include embeddings, computing genus distribution, and Hamiltonian decompositions.
In graph theory, a graph amalgamation is a relationship between two graphs (one graph is an amalgamation of another). Similar relationships include subgraphs and minors. Amalgamations can provide a way to reduce a graph to a simpler graph while keeping certain structure intact. The amalgamation can then be used to study properties of the original graph in an easier to understand context. Applications include embeddings, computing genus distribution, and Hamiltonian decompositions. If e joins x,y \in V(G) , where x \neq y , but \psi(x) = \psi(y) , then \phi(e) is a loop on \psi(x) . Note that while G can be a graph or a pseudograph, it will usually be the case that H is a pseudograph. Gross, Jonathan L. (2011), "Genus Distributions of Cubic Outerplanar Graphs", Journal of Graph Algorithms and Applications, Vol. 15, no. 2, pp. 295–316
Text derived from https://en.wikipedia.org/w/index.php?oldid=1344401777 under CC BY-SA 4.0; modifications have been made.