scientific article; zbMATH DE number 398941
From MaRDI portal
Publication:4201555
[For Part I, Part II and Part III see Zbl 0608.05028, Zbl 0578.05013 and Zbl 0699.05044, respectively.] The investigation of the packing number \(P(n,H)\), i.e. the maximal number of pairwise edge disjoint subgraphs of \(K_ n\) isomorphic to \(H\), and of the covering number \(C(n,H)\), i.e. the minimum number of subgraphs of \(K_ n\) isomorphic to \(H\) and covering \(K_ n\), is continued. For \(H\) being any tree of order seven and \(n \geq 11\) it is shown that \(P(n,H) = \lfloor {n(n-1) \over 12} \rfloor\) and \(C(n,H) = \lceil {n(n-1) \over 12} \rceil\).
Recommendations
Cited in
(10)- Packings and coverings of \(\lambda K_{v}\) by \(k\)-circuits with one chord.
- Coverings of a complete graph with five-vertex and five-edge graphs
- The spectrum of optimal excess graphs for trees with up to four edges
- Constructing the spectrum of packings and coverings for the complete graph with stars with up to five edges
- scientific article; zbMATH DE number 5914886 (Why is no real title available?)
- Constructing the spectrum for packings of the complete graph with trees that have up to five edges
- On relation between packing and covering number of graphs.
- scientific article; zbMATH DE number 3924794 (Why is no real title available?)
- scientific article; zbMATH DE number 1153448 (Why is no real title available?)
- scientific article; zbMATH DE number 1961003 (Why is no real title available?)
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 Q4201555)