scientific article; zbMATH DE number 4068925

From MaRDI portal
Publication:3801592





Let G be a graph containing a subgraph H without isolated vertices. The graph G is defined to be a randomly H graph if whenever F is a subgraph of G without isolated vertices that is isomorphic to a subgraph of H, then F can be extended to a subgraph \(H_ 1\) of G such that \(H_ 1\) is isomorphic to H. The authors provide a historic background of the concept of how the word ``randomly is used in some areas of graph theory and use it to introduce the idea of randomly H graphs. The authors characterize graphs that are randomly H graphs when H is \(2K_ 2\), \(P_ 3\), \(K_ n\), or \(C_ n\). They also characterize graphs G that are randomly H graphs for every subgraph H of G. These graphs are nK(1,m) (n,m\(\geq 1)\), \(nK_ 3(n\geq 1)\), \(K_ p(p\geq 4)\), \(C_ 4\), \(C_ 5\), and K(3,3).











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3801592)