Graph designs for all graphs with six vertices and eight edges
Let \(G\) be a finite simple graph. A \(G\)-design of order \(v\), denoted by \(G\)-\(GD(v)\), is a pair \((X,{\mathcal B})\), where \(X\) is the vertex set of the complete graph \(K_v\), and \(\mathcal B\) is a collection of subgraphs of \(K_v\), called blocks, such that each block is isomorphic to \(G\) and any two distinct vertices in \(K_v\) are adjacent in exactly one block. The obvious necessary conditions for the existence of a \(G\)-\(GD(v)\) are \(v\geq n\), \(v(v-1)\equiv0\;(\text{mod\;}2e)\), and \(v-1\equiv0\;(\text{mod\;}d)\), where \(n\) and \(e\) are the number of vertices and edges of \(G\), respectively, and \(d\) is the greatest common divisor of the degrees of all vertices in \(G\). The question, whether a \(G\)-\(GD(v)\) exists whose parameters \(v\), \(n\), \(e\), \(d\) satisfy the above necessary conditions, is called the ``graph design problem. Such a problem has been answered for particular graphs, and in most cases for \(n\leq5\) or \(n=6\) and \(e\leq7\). In this paper, the graph design problem is affirmatively answered for all \(22\) graphs with parameters \(n=6\) and \(e=8\), with at most two exceptions when \(v=32\).
- \(G\)-decomposition of \(K_n\), where G has four vertices or less
- Decompositions of complete graphs into isomorphic cubes
- Existence of holey LSSOM of type \(2^n\) with application to \(G_7\)-packings of \(K_v\)
- scientific article; zbMATH DE number 3710227 (Why is no real title available?)
- scientific article; zbMATH DE number 17515 (Why is no real title available?)
- scientific article; zbMATH DE number 25257 (Why is no real title available?)
- scientific article; zbMATH DE number 554067 (Why is no real title available?)
- scientific article; zbMATH DE number 2108151 (Why is no real title available?)
- scientific article; zbMATH DE number 867473 (Why is no real title available?)
- scientific article; zbMATH DE number 2188475 (Why is no real title available?)
- scientific article; zbMATH DE number 2195337 (Why is no real title available?)
- On diagonal cycle systems
- Packings and coverings of \(\lambda K_{v}\) by \(k\)-circuits with one chord.
- Graph designs for the eight-edge five-vertex graphs
- Packings and coverings of various complete graphs with the 4-cycle with a pendant edge
- scientific article; zbMATH DE number 5844256 (Why is no real title available?)
- Graph designs for a nine-edge six-vertex graph
- Graph design with eight vertices
- A survey on the existence ofG-Designs
- scientific article; zbMATH DE number 17515 (Why is no real title available?)
- scientific article; zbMATH DE number 2016767 (Why is no real title available?)
- scientific article; zbMATH DE number 2058432 (Why is no real title available?)
- Decomposition of complete graphs into connected unicyclic bipartite graphs with eight edges
- A complete solution to the spectrum problem for graphs with six vertices and up to nine edges
- scientific article; zbMATH DE number 6857389 (Why is no real title available?)
- Completing the design spectra for graphs with six vertices and eight edges
- scientific article; zbMATH DE number 6268993 (Why is no real title available?)
- scientific article; zbMATH DE number 2219717 (Why is no real title available?)
- G-designs for the connected triangular bicyclic graphs with nine edges
- Decomposition of \(\lambda K_v\) into five graphs with six vertices and eight edges
This page was built for publication: Graph designs for all graphs with six vertices and eight edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2508041)
