H-extension of graphs
Let two graphs G and H be given. Then \(G^*\) is said to be an immediate H-extension of G if it has a collection of section graphs isomorphic to G such that: (i) each vertex of \(G^*\) is in one of these copies of G, and (ii) if two copies of G intersect, their intersection is isomorphic to H. The main result is the following Theorem: if G can be partitioned into vertex-disjoint copies of H, then G admits an immediate H-extension \(G^*\) such that \(V(G^*)\) forms at most \(| H|\) orbits under the action of its automorphism group \(Aut(G^*)\). The authors also establish a condition on G which is sufficient for \(G^*\) to be vertex- transitive.
- Characterizations of H-graphs
- Some extensions of a hypergraph
- scientific article; zbMATH DE number 4145958
- On \(H\)-linked graphs
- On H-line graphs
- scientific article; zbMATH DE number 951851
- Hamiltonian extendable graphs
- Hamiltonian extension in digraphs
- On extension of regular graphs
- \(H\)-domination in graphs
This page was built for publication: H-extension of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q760443)
