Some general aspects of the framing number of a digraph
A digraph \(D\) is homogeneously embedded in a digraph \(H\) iff for each vertex \(x\) of \(D\) and each vertex \(y\) of \(H\) there exists an embedding of \(D\) in \(H\) as an induced subdigraph with \(x\) at \(y\). A digraph \(F\) of minimum order in which \(D\) can be homogeneously embedded is called a frame of \(D\) and the order of \(F\) is called the framing number of \(D\). The authors earlier showed [Util. Math. 47, 3-19 (1995; Zbl 0832.05049)] that such a digraph \(F\) exists. The associated concept for undirected graphs had been introduced earlier by \textit{G. Chartrand}, \textit{H. J. Gavlas}, and \textit{M. Schultz} [Bull. Inst. Comb. Appl. 4, 35-50 (1992; Zbl 0829.05022)] and the framing numbers of various classes of graphs were determined by \textit{W. Goddard}, \textit{M. A. Henning}, \textit{O. R. Oellermann}, and \textit{H. C. Swart} [Quaest. Math. 16, No. 3, 289-300 (1993; Zbl 0794.05123)]. In this paper the framing numbers of a particular orientation of the wheel and of transitive tournaments are established. It is shown that every tournament has a frame which is also a tournament. Finally, a relationship between the underlying graph of a digraph \(D\) and a frame of \(D\) is obtained.
- A note on cliques and independent sets
- scientific article; zbMATH DE number 1029237 (Why is no real title available?)
- scientific article; zbMATH DE number 1055145 (Why is no real title available?)
- scientific article; zbMATH DE number 800288 (Why is no real title available?)
- scientific article; zbMATH DE number 812068 (Why is no real title available?)
- SOME GENERAL ASPECTS OF THE FRAMING NUMBER OF A GRAPH
- WHICH TREES ARE UNIQUELY FRAMED BY THE HEAWOOD GRAPH?
This page was built for publication: Some general aspects of the framing number of a digraph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1383372)
